Sciweavers

2076 search results - page 2 / 416
» Universal Routing in Distributed Networks
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
TON
2010
158views more  TON 2010»
13 years 5 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
ICA3PP
2009
Springer
14 years 1 days ago
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scal...
Yamin Li, Shietung Peng, Wanming Chu
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
INFOCOM
2012
IEEE
11 years 10 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri