Sciweavers

INFOCOM
1999
IEEE
13 years 8 months ago
SRED: Stabilized RED
Teunis J. Ott, T. V. Lakshman, Larry H. Wong
INFOCOM
1999
IEEE
13 years 8 months ago
Distributed Wireless Channel Allocation in Networks with Mobile Base Stations
Abstract-In traditional cellular systems with fixed base stations the channel reuse pattern is static and deterministic. When the cell layout is dynamic, due to the mobility of bas...
Sanket Nesargi, Ravi Prakash
INFOCOM
1999
IEEE
13 years 8 months ago
New Dynamic SPT Algorithm Based on a Ball-and-String Model
A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS
Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng
INFOCOM
1999
IEEE
13 years 8 months ago
Cell Identification Codes for Tracking Mobile Users
The minimization of the wireless cost of tracking mobile users is a crucial issue in wireless networks. Some of the previous strategies addressing this issue leave an open gap, by ...
Zohar Naor, Hanoch Levy
INFOCOM
1999
IEEE
13 years 8 months ago
Performance Characteristics of Mirror Servers on the Internet
Abstract--As a growing number of web sites introduce mirrors to increase throughput, the challenge for clients becomes determining which mirror will offer the best performance when...
Andy Myers, Peter A. Dinda, Hui Zhang
INFOCOM
1999
IEEE
13 years 8 months ago
Analysis and Comparison of TCP Reno and Vegas
We propose some improvements of TCP Vegas and compare its performance characteristics in comparison with TCP Reno. We demonstrate through analysis that TCP Vegas, with its better ...
Jeonghoon Mo, Richard J. La, Venkat Anantharam, Je...
INFOCOM
1999
IEEE
13 years 8 months ago
The Window Distribution of Idealized TCP Congestion Avoidance with Variable Packet Loss
Abstract--This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varie...
Archan Misra, Teunis J. Ott
INFOCOM
1999
IEEE
13 years 8 months ago
Bandwidth Sharing: Objectives and Algorithms
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max
Laurent Massoulié, James Roberts
INFOCOM
1999
IEEE
13 years 8 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste