| Author | Thuya Lwin |
| Call Number | AIT RSPR no.TC-05-01 |
| Subject(s) | Multicasting (Computer networks)
Telecommunication--Traffic
|
| Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. TC-05-01 |
| Abstract | Multicasting is efficient way of transmitting data from a sender to a group of
receivers. A single source or group of source nodes sends identical messages
simultaneously to multiple destination nodes. A single rate of multicast transmission per
session is likely to either overwhelm the slow receivers or starve the fast ones. Multirate
multicast transmission is a proper way to figure out the unfair between the slowest one and
the fast ones per session. The main advantage of a multirate scheme is that receivers with
different needs can be served at a rate closer to their needs rather than having to match the
speed of the slowest receiver.
Among two types of approach to multirate data transmission, layered multicast
version is preferred in this research work and in congestion control for layered multicast
flows join consecutive upper layers and leave recent subscription layers. This research
work focuses on a simple multilayer multicast congestion control in the heterogeneous
network.
The multirate congestion control proposed in this research study named PMCC
(Proposed Multirate Congestion Control) modifies TFMCC (TCP-Friendly Multicast
Congestion Control) that uses minimum acceptable receiver rate to flawless multicast
traffic and achieves good fairness compared to unicast TCP (Transport Control Protocol)
traffic, with combining layering scheme of Binary Counting Layers (BCLs) that uses
additive increase join attempt mechanism to solve frequently join problem of layered
multicast data communication network. Simulation results show that PMCC can fairly
share network links to fundamental unicast TCP traffic while they have different
bandwidth capacities, different link delays, and different queue lengths. When the number
of hops in routing varies the fairness of PMCC remains varies between 0.8 and 1.4. |
| Year | 2005 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. TC-05-01 |
| Type | Research Study Project Report (RSPR) |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Erke, Tapio J.; |
| Examination Committee(s) | Ahmed, Kazi M.;
Teerapat Sanguankotchakorn; |
| Scholarship Donor(s) | Asian Institute of Technology Fellowship; |
| Degree | Research report (M.Sc.) - Asian Institute of Technology, 2005 |
