1 July 2002 Routing in DiffServ multicast environment
Author Affiliations +
Proceedings Volume 4865, Internet Performance and Control of Network Systems III; (2002); doi: 10.1117/12.473397
Event: ITCom 2002: The Convergence of Information Technologies and Communications, 2002, Boston, MA, United States
Abstract
QOS aware applications have propelled the development of two complementary technologies, Multicasting and Differentiated Services. To provide the required QOS on the Internet, either the bandwidth needs to be increased (Multicasting) or limited bandwidth prioritized among users (DiffServ). Although, the bandwidth on the Internet is continually increasing, the backbone is still insufficient to support QOS without resource allocations. Hence, there is a need to map multicasting in a DiffServ Environment to conserve network bandwidth and to provision this bandwidth in an appropriate fashion. In this regard, two issues have to be addressed. One, the key difference between multicast and DiffServe routing is the structure of the multicast tree. This tree is maintained in multicast aware routers whereas in DiffServe, the core routers maintain no state information regarding the flows. Second, the task of restructuring the multicast tree when members join/leave. Currently, the first issue is addressed by embedding the multicast information within the packet itself as an additional header field. In this paper, we propose a neural network based heuristic approach to address the second problem of routing in a dynamic DiffServe Multicast environment. Many dynamic multicast routing algorithms have been proposed. The greedy algorithm creates a near optimal tree when a node is added but requires many query/reply messages. The PSPT algorithm cannot construct a cost optimal tree. The VTDM algorithm requires the estimated number of nodes that will join and is not flexible. The problem of building an optimal tree to satisfy QOS requirements at minimum cost and taking minimum network resources is NP- complete and none of the above solutions give an optimal solution. We have modeled this combinatorial optimization as a nonlinear programming problem and trained an artificial neural network to solve the problem. The problem is tractable only when the QOS parameters are combined into DiffServe classes because of the flows are short-liv
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shekhar Verma, "Routing in DiffServ multicast environment", Proc. SPIE 4865, Internet Performance and Control of Network Systems III, (1 July 2002); doi: 10.1117/12.473397; https://doi.org/10.1117/12.473397
PROCEEDINGS
8 PAGES


SHARE
KEYWORDS
Internet

Neural networks

Receivers

Computer programming

Data modeling

Evolutionary algorithms

Video

Back to Top