A framework for routing and congestion control for multicast information flows

被引：44

作者：

Sarkar, S ^{[1
]}

Tassiulas, L

机构：

[1] Univ Penn, Dept Elect Engn, Philadelphia, PA 19104 USA

[2] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA

[3] Univ Maryland, Syst Res Inst, College Pk, MD 20742 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 10期

基金：

美国国家科学基金会;

关键词：

multicast; routing; scheduling; stability; throughput;

D O I：

10.1109/TIT.2002.802619

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose a new multicast routing and scheduling algorithm called multipurpose multicast routing and scheduling algorithm (MMRS). The routing policy load balances among various possible routes between the source and the destinations, basing its decisions on the message queue lengths at the source node. The scheduling is such that the flow of a session depends on the congestion of the next hop links. MMRS is throughput optimal. In addition, it has several other attractive features. It is computationally simple and can be implemented in a distributed, asynchronous manner. It has several parameters which can be suitably modified to control the end-to-end delay and packet loss in a topology-specific manner. These parameters can be adjusted to offer limited priorities to some desired sessions. MMRS is expected to play a significant role in end-to-end congestion control in the multicast scenario.

引用

页码：2690 / 2708

页数：19