Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation and Stabilized Buffer Occupation
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2195/2001
Book
Advances in Multimedia Information Processing — PCM 2001
DOI
10.1007/3-540-45453-5
Copyright
2001
ISBN
978-3-540-42680-6
DOI
10.1007/3-540-45453-5_73
Pages
566-573
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (157.5 KB)
Free Preview
A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation and Stabilized Buffer Occupation
Hu Yan
7
and Zhang Guangzhao
7
(7)
Department of Electronics and Communication Engineering, Zhongshan University, 510275 Guangzhou, P. R. China
Abstract
This paper proposes an active queue management algorithm we called “SCHOKe”, which wants to address the problems of providing a fair bandwidth allocation and a stabilized buffer occupancy in congested routers. The scheme works in concert with a simple FIFO queue that is shared by all flows, so it is stateless and easy to implement. In the algorithm, unresponsive flows are punished effectively and buffer occupancy is stabilized by a “hit”, which happens when an arriving packet's flow ID is the same as one of packets randomly chosen from the FIFO queue. Simulations of a TCP/IP network are used to illustrate the performance of the scheme.
Hu
Yan
Email:
hu_yan@263.net
Zhang
Guangzhao
Email:
isszgz@zsu.edu.cn
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.106 • Server: mpweb05
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)