Computer Networks | Sciweavers

59

NETWORKS
2008

129views Computer Networks» more NETWORKS 2008»

Grooming for two-period optical networks

14 years 6 months ago

Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...

Charles J. Colbourn, Gaetano Quattrocchi, Violet R...

claim paper

Read More »

48

click to vote

NETWORKS
2008

108views Computer Networks» more NETWORKS 2008»

F-Chord: Improved uniform routing on Chord

14 years 6 months ago

Download isis.dia.unisa.it

Gennaro Cordasco, Luisa Gargano, Alberto Negro, Vi...

claim paper

Read More »

76

click to vote

NETWORKS
2008

142views Computer Networks» more NETWORKS 2008»

Approximation bounds for Black Hole Search problems

14 years 6 months ago

Download hal.archives-ouvertes.fr

Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...

claim paper

Read More »

66

click to vote

NETWORKS
2008

208views Computer Networks» more NETWORKS 2008»

Competitive algorithms and lower bounds for online randomized call control in cellular networks

14 years 6 months ago

Download www.ceid.upatras.gr

Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...

claim paper

Read More »

59

click to vote

NETWORKS
2008

146views Computer Networks» more NETWORKS 2008»

Lower bounds for two-period grooming via linear programming duality

14 years 6 months ago

Download www.dmi.unict.it

In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...

Charles J. Colbourn, Gaetano Quattrocchi, Violet R...

claim paper

Read More »

72

click to vote

NETWORKS
2008

132views Computer Networks» more NETWORKS 2008»

Price competition with elastic traffic

14 years 6 months ago

Download web.mit.edu

In this paper, we present a combined study of price competition and traffic control in a congested network. We study a model in which service providers own the routes in a network...

Asuman E. Ozdaglar

claim paper

Read More »

55

click to vote

NETWORKS
2008

86views Computer Networks» more NETWORKS 2008»

A Reach and Bound algorithm for acyclic dynamic-programming networks

14 years 6 months ago

Download www-personal.umich.edu

Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...

Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...

claim paper

Read More »

45

click to vote

NETWORKS
2008

83views Computer Networks» more NETWORKS 2008»

The number of spanning trees in a class of double fixed-step loop networks

14 years 6 months ago

Download www.cs.ust.hk

In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...

Xuerong Yong, Yuanping Zhang, Mordecai J. Golin

claim paper

Read More »

44

click to vote

NETWORKS
2008

115views Computer Networks» more NETWORKS 2008»

Spectral bounds for the maximum cut problem

14 years 6 months ago

Download www.euro-online.org

Walid Ben-Ameur, José Neto

claim paper