Sciweavers

CN
2007
146views more  CN 2007»
13 years 4 months ago
TCP self-clocking and bandwidth sharing
— We propose a simple queueing model for TCP transfers sharing a bottleneck link and examine its behavior when the buffer at the bottleneck is large compared to the bandwidth-del...
Allen B. Downey
ICCCN
2007
IEEE
13 years 8 months ago
Fair Efficiency, or Low Average Delay without Starvation
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...
Sergey Gorinsky, Christoph Jechlitschek
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...
IWQOS
2005
Springer
13 years 10 months ago
Processor Sharing Flows in the Internet
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...
ICMCS
2005
IEEE
112views Multimedia» more  ICMCS 2005»
13 years 10 months ago
Rate-Distortion Optimized Packet Scheduling Over Bottleneck Links
The loss and delay experienced by packets travelling along an Internet network path are mainly governed by the characteristics of a bottleneck link, such as available data rate an...
Jacob Chakareski, Pascal Frossard
CONEXT
2006
ACM
13 years 10 months ago
Modeling ping times in first person shooter games
In First Person Shooter (FPS) games the Round Trip Time (RTT), i.e., the sum of the network delay from client to server and the network delay from server to client, impacts the ga...
Natalie Degrande, Danny De Vleeschauwer, Robert E....