A new receiver-based layered-rate estimator algorithm for fair bandwidth distribution

The Internet has given rise to the proliferation of non-behaving flows that consume excess network bandwidth from behaving TCP flows. This has brought about the development of fair bandwidth sharing mechanisms at routers to deal with non-responsive flows. One such scheme that allocates bandwidth fai...

Full description

Saved in:
Bibliographic Details
Main Authors: Papazis, K., Chilamkurti, N.K., Ben Soh
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Bandwidth
Channel allocation
Computer networks
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed computing
Exact sciences and technology
High-speed networks
Internet
IP networks
Multicast algorithms
Round robin
Software
Software engineering
State estimation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Internet has given rise to the proliferation of non-behaving flows that consume excess network bandwidth from behaving TCP flows. This has brought about the development of fair bandwidth sharing mechanisms at routers to deal with non-responsive flows. One such scheme that allocates bandwidth fairly to competing flows is core stateless fair queueing. This scheduling technique divides the network into edge routers that dominate the edge of the network and core routers that inhabit the interior of the network. However complexity contained at the edge of the network can prohibit the full-scale implementation of the scheme. We discuss the development of an alternative fair bandwidth-sharing mechanism that removes the edge router complexity imposed by CSFQ etc. and distributes bandwidth fairly amongst competing flows. To this end, we propose an algorithm known as source layered rate estimation (SLRE).
ISSN:0730-3157
DOI:10.1109/CMPSAC.2004.1342895