A novel rate-based hop by hop congestion control algorithm

Shu Ching Chen, Mei-Ling Shyu, Chengjun Zhan, Srinivas Peeta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publication2004 IEEE International Conference on Multimedia and Expo (ICME)
Pages245-248
Number of pages4
Volume1
StatePublished - Dec 1 2004
Event2004 IEEE International Conference on Multimedia and Expo (ICME) - Taipei, Taiwan, Province of China
Duration: Jun 27 2004Jun 30 2004

Other

Other2004 IEEE International Conference on Multimedia and Expo (ICME)
CountryTaiwan, Province of China
CityTaipei
Period6/27/046/30/04

Fingerprint

Congestion control (communication)
Traffic control
Packet loss
Computer networks
Internet
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

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) (Vol. 1, pp. 245-248)

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 proceedingConference contribution

Chen, SC, 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). vol. 1, pp. 245-248, 2004 IEEE International Conference on Multimedia and Expo (ICME), Taipei, Taiwan, Province of China, 6/27/04.
Chen SC, Shyu M-L, Zhan C, Peeta S. A novel rate-based hop by hop congestion control algorithm. In 2004 IEEE International Conference on Multimedia and Expo (ICME). Vol. 1. 2004. p. 245-248
Chen, Shu Ching ; Shyu, Mei-Ling ; Zhan, Chengjun ; Peeta, Srinivas. / A novel rate-based hop by hop congestion control algorithm. 2004 IEEE International Conference on Multimedia and Expo (ICME). Vol. 1 2004. pp. 245-248
@inproceedings{3ebb44e68cbe40b09ca3e95eb93fff16,
title = "A novel rate-based hop by hop congestion control algorithm",
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.",
author = "Chen, {Shu Ching} and Mei-Ling Shyu and Chengjun Zhan and Srinivas Peeta",
year = "2004",
month = "12",
day = "1",
language = "English",
isbn = "0780386035",
volume = "1",
pages = "245--248",
booktitle = "2004 IEEE International Conference on Multimedia and Expo (ICME)",

}

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

AN - SCOPUS:11244337961

SN - 0780386035

SN - 9780780386037

VL - 1

SP - 245

EP - 248

BT - 2004 IEEE International Conference on Multimedia and Expo (ICME)

ER -