Sciweavers

SIGCOMM
2004
ACM
13 years 10 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
SIGCOMM
2004
ACM
13 years 10 months ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...
SIGCOMM
2004
ACM
13 years 10 months ago
A wavelet-based approach to detect shared congestion
Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion manag...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....
SIGCOMM
2004
ACM
13 years 10 months ago
CapProbe: a simple and accurate capacity estimation technique
We present a new capacity estimation technique, called CapProbe. CapProbe combines delay as well as dispersion measurements of packet pairs to filter out samples distorted by cro...
Rohit Kapoor, Ling-Jyh Chen, Li Lao, Mario Gerla, ...
SIGCOMM
2004
ACM
13 years 10 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
SIGCOMM
2004
ACM
13 years 10 months ago
SPV: secure path vector routing for securing BGP
As our economy and critical infrastructure increasingly relies on the Internet, the insecurity of the underlying border gateway routing protocol (BGP) stands out as the Achilles h...
Yih-Chun Hu, Adrian Perrig, Marvin A. Sirbu
SIGCOMM
2004
ACM
13 years 10 months ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
SIGCOMM
2004
ACM
13 years 10 months ago
Optimizing cost and performance for multihoming
Multihoming is often used by large enterprises and stub ISPs to connect to the Internet. In this paper, we design a series of novel smart routing algorithms to optimize cost and p...
David Kiyoshi Goldenberg, Lili Qiu, Haiyong Xie 00...
SIGCOMM
2004
ACM
13 years 10 months ago
Locating internet routing instabilities
This paper presents a methodology for identifying the autonomous system (or systems) responsible when a routing change is observed and propagated by BGP. The origin of such a rout...
Anja Feldmann, Olaf Maennel, Zhuoqing Morley Mao, ...
SIGCOMM
2004
ACM
13 years 10 months ago
Building a better NetFlow
Network operators need to determine the composition of the traffic mix on links when looking for dominant applications, users, or estimating traffic matrices. Cisco’s NetFlow ha...
Cristian Estan, Ken Keys, David Moore, George Varg...