Sciweavers

552 search results - page 24 / 111
» Routing complexity of faulty networks
Sort
View
ICC
2007
IEEE
14 years 3 months ago
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
Edwin Soedarmadji, Robert J. McEliece
ALENEX
2010
143views Algorithms» more  ALENEX 2010»
13 years 10 months ago
Navigation in Real-World Complex Networks through Embedding in Latent Spaces
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
Xiaomeng Ban, Jie Gao, Arnout van de Rijt
CCR
2008
106views more  CCR 2008»
13 years 8 months ago
Message-efficient dissemination for loop-free centralized routing
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...
INFOCOM
2005
IEEE
14 years 2 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
IWSOS
2009
Springer
14 years 3 months ago
Self-organization of Internet Paths
The Internet consists of a constantly evolving complex hierarchical architecture where routers are grouped into autonomous systems (ASes) that interconnect to provide global connec...
Tom Kleiberg, Piet Van Mieghem