Effect of coarse timer granularities on QoS guarantees in Unix based systems

JH Kim, S Bahk, K Kim - 2000 IEEE International Conference …, 2000 - ieeexplore.ieee.org
While it is usually assumed that packet schedulers in routers have sufficiently fine-grain
timers, network systems frequently have timers of coarse granularity. Therefore application …

Performance impact of coarse timer granularities on qos guarantees in unix-based systems

JH Kim, S Bahk, H Kim - IEEE Transactions on Computers, 2003 - ieeexplore.ieee.org
Owing to the Internet's rapid expansion and fast advancing PC technology, there are many
PC-based network systems now. For increasingly many applications running over the …

[引用][C] Research on the Packet Scheduler for Unix based Systems-Timer granularity problems and solutions

JH Kim, S Bahk - 한국통신학회학술대회및강연회, 1999 - dbpia.co.kr
Many queue service disciplines for guaranteeing QoS of application services have been
researched. While almost always it was assumed that the packet scheduler has an infinitely …

TCP deadlock due to coarse timer granularities in Unix-based systems

JH Kim, S Bahk, H Kim - Electronics Letters, 1999 - pure.korea.ac.kr
While it is usually assumed that packet schedulers in routers have sufficiently fine-grain
timers, network systems frequently have timers of coarse granularity. An investigation into …

Design of packet-fair queuing schedulers in router

Y Haijun, H Peilin, L Jinsheng - WCC 2000-ICCT 2000. 2000 …, 2000 - ieeexplore.ieee.org
Implementing a packet scheduling mechanism in next generation routers has become a
central issue for providing networking-level QoS guarantees to a large number of sessions …

Workconserving vs. non-workconserving packet scheduling: An issue revisited

J Liebeherr, E Yilmaz - … Workshop on Quality of Service. IWQoS' …, 1999 - ieeexplore.ieee.org
Many packet schedulers for QoS networks are equipped with a rate control mechanism. The
function of a rate control mechanism (rate controller) is to buffer packets from flows which …

The performance of scheduling algorithms, with a prospect of bandwidth overprovisioning

Q Wangdong, C Hua, D Min, S Qingguo… - … , 2003. ICCT 2003., 2003 - ieeexplore.ieee.org
Between the two broad categories of packet scheduling algorithms, round robin and time
stamp based schemes, the former is usually not considered a proper candidate for providing …

SPD (Static Priority with Deadline Considerations) Packet Scheduling Algorithm for achieving better QoS

T Dag - International Conference on Networking and Services …, 2007 - ieeexplore.ieee.org
Providing quality of service (QoS) to applications with different traffic characteristics based
on their needs is an important research area for today's and tomorrow's high speed …

DMWRR: A QoS Scheduling for the Delay Fairness

LC Hwang, SJ Hsu, CY Ku, YT Tsai… - Proceedings of the 6th …, 2002 - scholar.nycu.edu.tw
In recent years, an explosive growth of network applications can be obviously observed.
This results in different traffic patterns which need different QoS requirements. For …

UBSFQ: An Urgency-Based Start-time Fair Queuing Scheduling

L Wen-Bo, G Yun-Fei, M Hai-long… - … Software and Networks, 2009 - ieeexplore.ieee.org
How to provide a broad range of QoS guarantees in a packet network is an important issue.
In order to achieve QoS guarantees, good traffic schedulers are indispensable. In this paper …