Sciweavers

2796 search results - page 122 / 560
» The coolest path problem
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 4 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
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
ICDCSW
2009
IEEE
15 years 11 months ago
Dynamic TCP Proxies: Coping with Disadvantaged Hosts in MANETs
Applications in mobile ad-hoc networks can suffer from poor link quality and degraded network services. In particular, standard TCP over low-quality, long routing paths, can have ...
Tu Ouyang, Shudong Jin, Michael Rabinovich
149
Voted
IMC
2005
ACM
15 years 10 months ago
Exploiting Internet Route Sharing for Large Scale Available Bandwidth Estimation
Recent progress in active measurement techniques has made it possible to estimate end-to-end path available bandwidth. However, how to efficiently obtain available bandwidth info...
Ningning Hu, Peter Steenkiste
ICNP
2002
IEEE
15 years 10 months ago
pTCP: An End-to-End Transport Layer Protocol for Striped Connections
The TCP transport layer protocol is designed for connections that traverse a single path between the sender and receiver. However, there are several environments in which multiple...
Hung-Yun Hsieh, Raghupathy Sivakumar