Sciweavers

988 search results - page 128 / 198
» Routing in a delay tolerant network
Sort
View
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
TON
2008
109views more  TON 2008»
13 years 8 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
IPPS
2006
IEEE
14 years 2 months ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
SIGMETRICS
1999
ACM
14 years 1 months ago
NFS Sensitivity to High Performance Networks
This paper examines NFS sensitivity to performance characteristics of emerging networks. We adopt an unusual method of inserting controlled delays into live systems to measure sen...
Richard P. Martin, David E. Culler
INFOCOM
2002
IEEE
14 years 1 months ago
A Proxy Based Indirect Routing Scheme for Ad Hoc Wireless Networks
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
Wook Choi, Sajal K. Das