Sciweavers

212 search results - page 3 / 43
» Fair and Efficient Packet Scheduling in Wormhole Networks
Sort
View
SIGCOMM
2012
ACM
11 years 8 months ago
Multi-resource fair queueing for packet processing
Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastl...
Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica
APNOMS
2006
Springer
13 years 9 months ago
QoS-Aware Fair Scheduling in Wireless Ad Hoc Networks with Link Errors
To provide scheduling in wireless ad hoc networks, that is both highly efficient and fair in resource allocation, is not a trivial task because of the unique problems in wireless n...
Muhammad Mahbub Alam, Md. Mamun-Or-Rashid, Choong ...
NOCS
2008
IEEE
14 years 5 days ago
Real-Time Communication Analysis for On-Chip Networks with Wormhole Switching
Abstract— In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach i...
Zheng Shi, Alan Burns
GLOBECOM
2007
IEEE
13 years 7 months ago
A Cross-Layer Proportional Fair Scheduling Algorithm with Packet Length Constraint in Multiuser OFDM Networks
— 1 In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences sc...
Jinri Huang, Zhisheng Niu
INFOCOM
2005
IEEE
13 years 11 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang