Sciweavers

5054 search results - page 635 / 1011
» simulation 2008
Sort
View
TON
2008
74views more  TON 2008»
15 years 6 months ago
Race conditions in coexisting overlay networks
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
TON
2008
76views more  TON 2008»
15 years 6 months ago
Minimizing file download time in stochastic peer-to-peer networks
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show th...
Yuh-Ming Chiu, Do Young Eun
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TON
2008
102views more  TON 2008»
15 years 6 months ago
Designing less-structured P2P systems for the expected high churn
Abstract--We address the problem of highly transient populations in unstructured and loosely-structured peer-to-peer systems. We propose a number of illustrative query-related stra...
Fabián E. Bustamante, Yi Qiao
TON
2008
136views more  TON 2008»
15 years 6 months ago
Density-based anycast: a robust routing strategy for wireless ad hoc networks
Abstract--Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing para...
Vincent Lenders, Martin May, Bernhard Plattner