Sciweavers

765 search results - page 22 / 153
» Self-organization of Internet Paths
Sort
View
HT
2003
ACM
14 years 22 days ago
Browsing intricately interconnected paths
Graph-centric and node-centric browsing are the two commonly identified hypertext-browsing paradigms. We believe that pathcentric browsing, the browsing behavior exhibited by path...
Pratik Dave, Unmil Karadkar, Richard Furuta, Luis ...
NETCOOP
2009
Springer
14 years 2 months ago
Control of Multipath TCP and Optimization of Multipath Routing in the Internet
There are moves in the Internet architecture community to add multipath capabilities to TCP, so that end-systems will be able to shift their traffic away from congested parts of th...
Damon Wischik, Mark Handley, Costin Raiciu
MASCOTS
2004
13 years 9 months ago
Routing in an Internet-Scale Network Emulator
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
Jay Chen, Diwaker Gupta, Kashi Venkatesh Vishwanat...
CCR
2004
106views more  CCR 2004»
13 years 7 months ago
Decoupling policy from mechanism in Internet routing
Routing is a black art in today's Internet. End users and ISPs alike have little control over how their packets are handled outside of their networks, stemming in part from l...
Alex C. Snoeren, Barath Raghavan
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 3 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled