Sciweavers

88 search results - page 14 / 18
» Gateway designation for timely communications in instant mes...
Sort
View
FOCS
1995
IEEE
14 years 3 days ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 12 days ago
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
Wensheng He, Arun K. Somani
GLOBECOM
2007
IEEE
14 years 2 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
INFOCOM
2000
IEEE
14 years 28 days ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
DAC
2006
ACM
14 years 2 months ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone