Sciweavers

21 search results - page 3 / 5
» Fair Scheduling through Packet Election
Sort
View
SIGCOMM
2012
ACM
12 years 1 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
TON
2010
115views more  TON 2010»
13 years 5 months ago
Feedback-Based Scheduling for Load-Balanced Two-Stage Switches
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...
Bing Hu, Kwan L. Yeung
PIMRC
2008
IEEE
14 years 5 months ago
Distributed scheduling with end-to-end compensation in multihop ad hoc networks
Abstract-In this paper, we investigate the problem of providing QoS to end-to-end flows in multihop ad hoc networks with channel errors through packet scheduling. Each flow is asso...
Yijiang Sun, Victor O. K. Li, Ka-Cheong Leung
AICCSA
2005
IEEE
164views Hardware» more  AICCSA 2005»
14 years 4 months ago
Efficient aggregation of delay-constrained data in wireless sensor networks
Recent years have witnessed a growing interest in the application of wireless sensor networks in unattended environments. Nodes in such applications are equipped with limited ener...
Kemal Akkaya, Mohamed F. Younis, Moustafa Youssef
HICSS
2003
IEEE
183views Biometrics» more  HICSS 2003»
14 years 4 months ago
CRMA: A Cycle-breaking Multicast Routing Algorithm for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...