Sciweavers

2343 search results - page 127 / 469
» The Locomotive Routing Problem
Sort
View
PODC
2005
ACM
14 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
INFOCOM
2000
IEEE
14 years 1 months ago
Minimum Interference Routing with Applications to MPLS Traffic Engineering
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
Murali S. Kodialam, T. V. Lakshman
AINA
2008
IEEE
14 years 4 months ago
Ternary CAM Compaction for IP Address Lookup
Motivated by the high cost problem of ternary CAM, we proposed a new technique for providing a compaction routing table. With the comparisons with existing algorithms, our new tec...
Yi-Ting Fang, Tzung-Chian Huang, Pi-Chung Wang
INFOCOM
2007
IEEE
14 years 4 months ago
Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks
—Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use re...
Qing Cao, Tarek F. Abdelzaher, Tian He, Robin Krav...
ETFA
2005
IEEE
14 years 3 months ago
ZRP versus DSR and TORA: a comprehensive survey on ZRP performance
Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidd...
Spilios Giannoulis, Christos D. Antonopoulos, Evan...