Sciweavers

9 search results - page 2 / 2
» Accomplishing Approximate FCFS Fairness Without Queues
Sort
View
TON
2010
176views more  TON 2010»
13 years 3 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
INFOCOM
2003
IEEE
14 years 1 months ago
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Abstract—In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of...
Jacqueline Boyer, Fabrice Guillemin, Philippe Robe...
INFOCOM
2006
IEEE
14 years 2 months ago
Dual-Resource TCP/AQM for Processing-Constrained Networks
— This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even r...
Minsu Shin, Song Chong, Injong Rhee
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...