Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9713
Title: | -. A RELIABLE MULTICAST PROTOCOL USING ACTIVE SERVICE ARCHITECTURE |
Authors: | Prakash, Satya |
Keywords: | ELECTRONICS AND COMPUTER ENGINEERING;RELIABLE MULTICAST PROTOCOL;ACTIVE SERVICE ARCHITECTURE;CONGESTION CONTROL |
Issue Date: | 2001 |
Abstract: | Besides scalability, the design of reliable multicast transport protocols, requires careful consideration of a number of other problems such as feedback implosion, retransmission scoping, distributed loss recovery, and congestion control. For addressing these challenges a reliable multicast architecture is used that invokes active services at specific location inside the network. Active services provide the ability to quickly and efficiently recover from the loss near the point of the loss. They also exploit the physical hierarchy for feedback aggregation and effective retransmission scoping. For this architecture two protocols are discussed in this dissertation work, one for packet loss recovery and other for congestion control. In Congestion control protocol, sender regulates its transmission rate according to per packet acknowledgement got from a specific receiver called nominee. This dissertation investigates a dynamic nominee scheme where the nominee selection process,is repeated periodically to update the nominee in response to change of congestion level at different multicast paths in the network. Simulation experiments were conducted to study these protocols to show that active service architecture improves resource usage, and provides TCP-friendly congestion control. |
URI: | http://hdl.handle.net/123456789/9713 |
Other Identifiers: | M.Tech |
Research Supervisor/ Guide: | Sarje, A. K. |
metadata.dc.type: | M.Tech Dessertation |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECDG10441.pdf | 5.13 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.