Sciweavers

44 search results - page 3 / 9
» Stable Internet routing without global coordination
Sort
View
PAM
2005
Springer
13 years 11 months ago
Internet Routing Policies and Round-Trip-Times
Abstract. Round trip times (RTTs) play an important role in Internet measurements. In this paper, we explore some of the ways in which routing policies impact RTTs. In particular, ...
Han Zheng, Eng Keong Lua, Marcelo Pias, Timothy G....
CCR
2006
117views more  CCR 2006»
13 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ICON
2007
IEEE
14 years 10 days ago
Myth: An Accurate and Scalable Network Coordinate System under High Node Churn Rate
—Network coordinate (NC) system is an efficient mechanism to predict Internet distance (latency) with limited times of measurement. In this paper, we focus on the node churn pro...
Yang Chen, Genyi Zhao, Ang Li, Beixing Deng, Xing ...
INFOCOM
2009
IEEE
14 years 21 days ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
SIGCOMM
2005
ACM
13 years 11 months ago
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
Nick Feamster, Ramesh Johari, Hari Balakrishnan