Sciweavers

214 search results - page 36 / 43
» Improving Topological Routing in N2R Networks
Sort
View
SPAA
2003
ACM
14 years 26 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ICDCS
2007
IEEE
14 years 1 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
LCN
2008
IEEE
14 years 2 months ago
A forwarding protocol with relay acknowledgement for vehicular ad-hoc networks
—In vehicular ad-hoc networks (VANETs), mobility is one of key characteristics that have a significant effect on routing performance because it causes dynamic changes of network...
Inhyeok Jang, Wooyeol Choi, Hyuk Lim
TEC
2002
117views more  TEC 2002»
13 years 7 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 8 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter