Sciweavers

1859 search results - page 131 / 372
» Sketch-based path design
Sort
View
ICNP
2005
IEEE
14 years 2 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...
HIPC
2007
Springer
14 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
NETWORKING
2007
13 years 10 months ago
Maximum Energy Welfare Routing in Wireless Sensor Networks
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
Changsoo Ok, Prasenjit Mitra, Seokcheon Lee, Sound...
ICWE
2009
Springer
14 years 1 months ago
Semantic web access prediction using WordNet
The user observed latency of retrieving Web documents is one of limiting factors while using the Internet as an information data source. Prefetching became important technique ...
Lenka Hapalova
CCR
2007
115views more  CCR 2007»
13 years 9 months ago
Analysis of the SPV secure routing protocol: weaknesses and lessons
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
Barath Raghavan, Saurabh Panjwani, Anton Mityagin