Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

Token-based congestion control: Achieving fair resource allocations in P2P networks

By: Zhiqiang Shi;

2008 / IEEE / 978-92-61-12441-0

Description

This item was taken from the IEEE Conference ' Token-based congestion control: Achieving fair resource allocations in P2P networks ' Fair Queueing designed to achieve fair bandwidth allocations like CSFQ and Stochastic Fair BLUE, have many desirable properties for congestion control in Internet. However, such mechanisms usually supervise the bandwidth consumption of per-flow, and are good for nothing while P2P flows dominate the traffic of Internet. In this paper, we propose a Token-Based Congestion Control, which limits the access token resource consumed by every subscriber, and provides substantial fairness in P2P networks. In this congestion control system, there are three important devices: core routers, edge routers, terminals. Core routers measure congestion level, and convey it to terminals along with data flows. Terminals label the Token-Level on sent packets according to the Congestion-Index in the transport path, and regulate the average speed of output tokens, which are the multiplication of the packet size and the Token-Level. Edge routers police the input token rate of every terminal. We present simulations and analyses on the performance of this approach at last.