Sciweavers

318 search results - page 16 / 64
» Understanding Route Redistribution
Sort
View
79
Voted
GIS
2008
ACM
14 years 11 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
ANCS
2010
ACM
14 years 8 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
85
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
MV routing and capacity building in disruption tolerant networks
— Disruption-Tolerant networks (DTNs) differ from other types of networks in that capacity is exclusively created by the movements of participants. This implies that understandin...
Brendan Burns, Oliver Brock, Brian Neil Levine
MINENET
2006
ACM
15 years 4 months ago
How to extract BGP peering information from the internet routing registry
We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: ...
Giuseppe Di Battista, Tiziana Refice, Massimo Rimo...
CORR
2010
Springer
123views Education» more  CORR 2010»
14 years 8 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich