Multimedia content now contribute to a huge amount of the Internet traffic due to the popularity and availability of anytime anywhere Internet connection. Unlike the circuit-switched telephone network – in which necessary resources are reserved for communication between two parties at the time the connection is established, a packet-switched network, like the Internet, only guarantees the reachability when the connection between two parties is established. In other words, the end-to-end delay and available bandwidth between two hosts depend on the amount of traffic on the network. The communication paths between the participating hosts are also determined by the routing policies and hence are not under control of the participating hosts. Hence how to improve the performance of delivering multimedia content on the Internet has become an interesting research topic.
In this dissertation, we consider the problem of delivering multimedia contents using multicast wherein a group of participants are participating in the same communication session. We assume the networks are flexible such that the end hosts can specify the communication paths. A few examples of this type of networks are overlay networks and IPv6 network with source routing support. This problem is addressed from both routing and network traffic perspectives.
First, we assume a two-layer approach which includes a well-provisioned service overlay network and the regular Internet. The participants in the multimedia group communication can take the advantage of the service overlay network by connecting to the nodes in the service overlay network through the Internet. We consider two major assignment problems – Server and Client Assignment Problem (SCAP, Client-Server model) and Client Assignment Problem (CAP, Peer-to-Peer model) as well as several variants of these problems. These problems are [special characters omitted]-hard and we have developed polynomial-time heuristic algorithms to assign the participants to appropriate service nodes such that some real-time constraint(s) are satisfied and the number of service nodes involved are minimal. Integer programming (IP) models for solving these problems are also developed for performance evaluation purpose. Empirical results show that the solution quality of the proposed algorithms compares favorably with the optimal ones obtained from the execution of IP models, while keeping the execution times significantly low.
We have also considered the Multi-stream Multi-source Multicast Routing Problem ( MMMRP). Given a network and a set of multicast sessions, each with one or more sources and multiple destinations. The goal of MMMRP is to determine multiple multicast tree for these multicast sessions on the given network in such a way that the overall residual bandwidth on the links that are shared among the trees is maximized. We prove that MMMRP is [special characters omitted]-hard and apart from providing an IP formulation, we have also provided a heuristic algorithm MMForests which runs in polynomial-time. We compared and contrasted the performance of MMMRP with known algorithms for the multicast tree packing problem. Our exhaustive empirical evaluations show that our heuristic has a very low execution-time while achieving the optimal residual bandwidth. In addition, our heuristic is very scalable as it is able to produce results for networks with thousands of nodes, unlike the other ones which are based on Steiner tree heuristics.
|Advisor:||Dhall, Sudarshan K., Radhakrishnan, Sridhar|
|Commitee:||Antonio, John K., Karabuk, Suleyman, Lakshmivarahan, S.|
|School:||The University of Oklahoma|
|School Location:||United States -- Oklahoma|
|Source:||DAI-B 74/04(E), Dissertation Abstracts International|
|Keywords:||Computer networks, Content delivery, Integer programming, Multicast, Quality of service|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be