Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/123456789/593
Title: ENHANCEMENT OF SINGLE RATE MULICAST CONGESTION CONTROL POLICY
Authors: AGGARWAL, AMIT
Keywords: Congestion
Control Policy
Mulicast
Issue Date: 30-Jun-2006
Series/Report no.: TD-152;81
Abstract: Multicast is the preferred transport mechanism for bulk data transfer to multiple receivers especially in multimedia applications and services on the internet. Applications like content distribution, streaming, multi-player games, multimedia multi-user chat/telephony, distance education etc could benefit from multicast and QoS. Multicast congestion control is the first step toward a multicast QoS architecture for the Internet. There are two categories of multicast congestion control. One of them is single-rate, in which the source controls the data transmission rate and all receivers receive data at the same rate. The other is multi-rate (layered multicast congestion control), in which receivers join just enough layers in the form of multicast groups to retrieve data as fast as they can. This dissertation intended for the policy which is the enhancement of the single-rate multicast congestion control scheme (ESMCC) based on a new metric calculation, Throughput Rate on Congestion. It reduces a memory complexity to maintain state information at source and receivers; requires only simple computations. It addresses the pieces of the single-rate multicast congestion control problem including drop-to-zero issues, TCP friendliness and RTT estimation. It’s rate-based on additive increase multiplicativedecrease (AIMD) module and does not necessitate measurement of RTTs from all receivers to the source. It is very effective with feedback suppression.
Description: ME THESIS
URI: http://dspace.dtu.ac.in:8080/jspui/handle/123456789/593
Appears in Collections:M.E./M.Tech. Computer Technology & Applications

Files in This Item:
File Description SizeFormat 
TD-152.pdf1.33 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.