Sciweavers

278 search results - page 11 / 56
» Network Topology Design to Optimize Link and Switching Costs
Sort
View
ICNP
2002
IEEE
14 years 10 days ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
PC
2010
111views Management» more  PC 2010»
13 years 5 months ago
Reducing complexity in tree-like computer interconnection networks
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...
Javier Navaridas, José Miguel-Alonso, Franc...
IWSOS
2009
Springer
14 years 1 months ago
A Distributed Range Assignment Protocol
We present a new distributed algorithm for creating and maintaining power-efficient topologies in a wireless network. The wireless nodes establish links to neighbouring nodes in a ...
Steffen Wolf, Tom Ansay, Peter Merz
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 24 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 1 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks