Abstract

Widespread deployment of multicast depends on the existence of congestion control protocols that are provably fair to unicast traffic. In this work, we present an optimization-based congestion control mechanism for single-rate multicast communication with provable fairness properties. The optimization-based approach attempts to find an allocation of rates that maximizes the aggregate utility of the network. We show that the utility of multicast sessions must be carefully defined if a widely accepted property of aggregate utility is to hold. Our definition of session utility amounts to maximizing a weighted sum of simple utility functions, with weights determined by the number of receivers. The fairness properties of the optimal rate allocation depend both on the weights and form of utility function used. We present analysis for idealized topologies showing that while our mechanism is not strictly fair to unicast, its unfairness can be controlled by appropriate choices of parameters. Document type: Part of book or chapter of book

Abstract

We show that the “fractal” behavior of Internet traffic can be efficiently and practically employed to significantly reduce packet-loss. Thanks to recent advances in the theory of self-similar processes, we define the probabilistic congestion of a link, based on an estimated computation of the packet-loss probability over that link. This congestion parameter allows valid predictions on the future behavior of the network, on which one can base efficient routing strategies. We show how to implement the computation of the probabilistic congestion, and we illustrate several applications for improving unicast and multicast protocols. Document type: Part of book or chapter of book

Abstract

Recently, much research in quality of service (QoS) routing has focused on the unicast communication technique. However, Content Delivery Network (CDN) approach becomes popular because CDN enables effective and inexpensive improvement of Internet service quality. Therefore, we analyze in this paper a network processing two kinds of demands: content demands to CDN servers and standard unicast demands. Since MPLS defines effective mechanism for traffic engineering, we assume that the CDN is located in MPLS network. To examine the QoS performance of CDN-enabled MPLS network we propose new constraint-based algorithms for CDN server selection and evaluate relative performance of these algorithms and the most effective existing QoS unicast routing algorithms in terms of the demand rejection ratio. Document type: Part of book or chapter of book