Sciweavers

121 search results - page 18 / 25
» A routing protocol for finding two node-disjoint paths in co...
Sort
View
CCR
2002
86views more  CCR 2002»
13 years 6 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 6 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
CONEXT
2009
ACM
13 years 7 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
ICPPW
2002
IEEE
13 years 11 months ago
Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
David W. Griffith, SuKyoung Lee
BROADNETS
2004
IEEE
13 years 10 months ago
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
Pallab Datta, Arun K. Somani