Abstract
As the development of Internet continues, congestion control has become a big issue to the computer network society. Most of the congestion control schemes fall into two categories: end-to-end and hop-by-hop schemes. In this paper, we propose a novel hop-by-hop algorithm that originates from a classical traffic control algorithm. The experimental results show that our proposed algorithm can achieve short delays and quick responses to the congestion situations and cause no packet loss. It can also minimize the bandwidth requirement and achieve very high buffer usage level for nodes along the transmission path.
| Original language | English (US) |
|---|---|
| Title of host publication | 2004 IEEE International Conference on Multimedia and Expo (ICME) |
| Pages | 245-248 |
| Number of pages | 4 |
| State | Published - Dec 1 2004 |
| Event | 2004 IEEE International Conference on Multimedia and Expo (ICME) - Taipei, Taiwan, Province of China Duration: Jun 27 2004 → Jun 30 2004 |
Publication series
| Name | 2004 IEEE International Conference on Multimedia and Expo (ICME) |
|---|---|
| Volume | 1 |
Other
| Other | 2004 IEEE International Conference on Multimedia and Expo (ICME) |
|---|---|
| Country | Taiwan, Province of China |
| City | Taipei |
| Period | 6/27/04 → 6/30/04 |
ASJC Scopus subject areas
- Engineering(all)
Fingerprint Dive into the research topics of 'A novel rate-based hop by hop congestion control algorithm'. Together they form a unique fingerprint.
Cite this
Chen, S. C., Shyu, M. L., Zhan, C., & Peeta, S. (2004). A novel rate-based hop by hop congestion control algorithm. In 2004 IEEE International Conference on Multimedia and Expo (ICME) (pp. 245-248). (2004 IEEE International Conference on Multimedia and Expo (ICME); Vol. 1).