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 |
|---|---|
| Title of host publication | 2004 IEEE International Conference on Multimedia and Expo (ICME) |
| Pages | 245-248 |
| Number of pages | 4 |
| Volume | 1 |
| 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 |
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 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
A novel rate-based hop by hop congestion control algorithm. / Chen, Shu Ching; Shyu, Mei-Ling; Zhan, Chengjun; Peeta, Srinivas.
2004 IEEE International Conference on Multimedia and Expo (ICME). Vol. 1 2004. p. 245-248.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - A novel rate-based hop by hop congestion control algorithm
AU - Chen, Shu Ching
AU - Shyu, Mei-Ling
AU - Zhan, Chengjun
AU - Peeta, Srinivas
PY - 2004/12/1
Y1 - 2004/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=11244337961&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=11244337961&partnerID=8YFLogxK
M3 - Conference contribution
SN - 0780386035
SN - 9780780386037
VL - 1
SP - 245
EP - 248
BT - 2004 IEEE International Conference on Multimedia and Expo (ICME)
ER -