Sciweavers

2343 search results - page 327 / 469
» The Locomotive Routing Problem
Sort
View
IWNAS
2008
IEEE
15 years 11 months ago
POND: The Power of Zone Overlapping in DHT Networks
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
168
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
134
Voted
ANOR
2005
102views more  ANOR 2005»
15 years 5 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
TCAD
2008
128views more  TCAD 2008»
15 years 5 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
CN
2004
150views more  CN 2004»
15 years 4 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz