Sciweavers

666 search results - page 47 / 134
» Describing and simulating internet routes
Sort
View
ICDCS
2002
IEEE
14 years 25 days ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao
MASCOTS
2003
13 years 9 months ago
Creating Realistic BGP Models
Modeling the Internet infrastructure is a challenging endeavor. Complex interactions between protocols, increasing traffic volumes and the irregular structure of the Internet lea...
Xenofontas A. Dimitropoulos, George F. Riley
ICNP
2005
IEEE
14 years 1 months ago
Can coexisting overlays inadvertently step on each other?
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
ICCCN
2007
IEEE
13 years 11 months ago
Scalable Peer-to-Peer File Sharing with Efficient Complex Query Support
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
Yan Li, Jyoti Ahuja, Li Lao, Jun-Hong Cui
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 8 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez