Sciweavers

93 search results - page 8 / 19
» Credit based fair scheduling for packet switched networks
Sort
View
INFOCOM
2002
IEEE
15 years 2 months ago
A Congestion Control Algorithm for Tree-based Reliable Multicast Protocols
— This paper contains a detailed description of the congestion control algorithm of TRAM, a tree-based reliable multicast protocol. This algorithm takes advantage of regular ackn...
Dah-Ming Chiu, Miriam Kadansky, Joe Provino, Josep...
ITRE
2005
IEEE
15 years 3 months ago
MR-FQ: a fair scheduling algorithm for wireless networks with variable transmission rates
— Wireless networks are characterized by bursty and location-dependent errors. Although many fair scheduling methods have been proposed to address these issues, most of them assu...
You-Chiun Wang, Yu-Chee Tseng, Wen-Tsuen Chen, Kun...
NOCS
2008
IEEE
15 years 3 months 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
INFOCOM
1998
IEEE
15 years 1 months ago
Dynamic Flow Switching, A New Communication Service for ATM Networks
This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is des...
Qiyong Bian, Kohei Shiomoto, Jonathan S. Turner
INFOCOM
2000
IEEE
15 years 1 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste