Sciweavers

173 search results - page 20 / 35
» Round Robin Classification
Sort
View
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 12 days ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
DSRT
2000
IEEE
14 years 11 days ago
Scheduling for Very Large Virtual Environments and Networked Games Using Visibility and Priorities
The problem of network bundwidth limitutions is encountered in ulmost uny distributed virtuul environment or networkedgume. In U typicul client-serversetup, where the virtuul worl...
Chris Faisstnauer, Dieter Schmalstieg, Werner Purg...
ICNP
2000
IEEE
14 years 11 days ago
Generalized Load Sharing for Packet-Switching Networks
—In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sh...
Ka-Cheong Leung, Victor O. K. Li
ISORC
2000
IEEE
14 years 10 days ago
TCP Throughput and Buffer Management
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...
Todd Lizambri, Fernando Duran, Shukri Wakid
GCC
2006
Springer
13 years 11 months ago
BSM: A scheduling algorithm for dynamic jobs based on economics theory
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianji...