Policy aware QoS inter-domain multicast

Future Internet applications are expected to have higher QoS requirements. Therefore, routing protocols must be adapted to find a path which satisfies such requirements. Most multicast applications are QoS sensitive in nature, because they involve the transmission of real-time multimedia data streams. There are several research projects aiming to extend existing multicast routing protocols with QoS capabilities, or even proposing new QoS aware ones. However key requirements for inter-domain routing like scalability, intra-domain independence, and policy awareness are missing in most of existing multicast routing protocols. In this paper, it is proposed an inter-domain multicast routing strategy that builds inter-domain unidirectional multicast distribution trees, taking into account multicast specific routing policies, and supporting QoS requirements

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

Within the development of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. Multicast IP routing is an important topic, covering both theoretical and practical interest in different networks layers. In network layer, there are several multicast routing protocols using multicast routing trees different in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared Core-based Tree CBT. This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The prime problem concerning construction of a shared tree is to determine the best position of the core. QoS-CS’s problem (QoS constraints core Selection) consists in choosing an optimal multicast router in the network as core of the Shared multicast Tree (CBT) within specified QoS constraints associated. The choice of this specific router, called RP in PIM-SM protocol and core in CBT protocol, affects the structure of multicast routing tree, and therefore influences performances of both multicast session and routing scheme. QoS-CS is an NP complete problem need to be solved through a heuristic algorithm, in this paper, we propose a new core Selection algorithm based on Variable Neighborhood Search algorithm and new CMP fitness function. Simulation results show that good performance is achieved in multicast cost, end-to-end delay, tree construction delay and others metrics

Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods

Copyright @ 2010 Elsevier B.V. All rights reserved.In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search

Copyright @ 2009 IEEE Computer SocietyThis paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing

This is the post-print version of the article - Copyright @ 2008 Springer-VerlagThis paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

IMS signalling for multiparty services based on network level multicast

3rd EURO-NGI Conference on Next Generation Internet Networks. Norwegian University of Science and Technology, Trondheim, Norway, 21-23 may 2007.The standardization process of the UMTS technology has led to the development of the IP Multimedia Subsystem (IMS). IMS provides a framework that supports the negotiation of the next generation multimedia services with QoS requirements that are envisioned for 3G networks. But even though many of these services involve the participation of multiple users in a multiparty arrangement, the delivery technology at network level is still unicast based. This approach is not optimum, in terms of transmission efficiency. In this paper, a new approach is presented proposing to use a network level multicast delivery technology for the multiparty services that are signalled through IMS. The main advantages and drawbacks related with this new approach are analyzed in the article. Finally, as a starting point in the development of the presented solution, a new SIP signalling dialogue is proposed allowing the negotiation of a generic multiparty service, and supporting at the same time the configuration of the corresponding network level multicast delivery service with QoS requirements that will be used in the user plane.Publicad

A new path probing strategy for inter-domain multicast routing

Many already in use applications require the provision of QoS services from the underlying network infra-structure. This is particularly true for multicast, since it involves many participants at very sparse locations usually aiming to receive or send multimedia real-time streams. One way to provide QoS is through routing, since QoS aware multicast routing protocols can find feasible multicast trees. At large scale, scalability issues make the QoS multicast routing task a lot more difficult, since it is not possible to have a complete knowledge of the network topology and its path QoS metrics in a clear up-to-date way. The most promising proposals are therefore based on path probing strategies that evaluate a subset of the available connecting paths. Assuming that each member can express its requirements as a combination of QoS metrics like available bandwidth, end-to-end loss probability and delay, it is up to QoS routing multicast protocols to build distribution trees connecting members through paths that can satisfy those requirements. In this paper an inter-domain QoS multicast routing protocol is presented, specifically designed for the hierarchical inter-domain scenario, where requirements like intra-domain independency and policy awareness should be met. Emphasis is given to the path probing mechanism used to connect new members to the multicast tree, stressing how it differs from others. Simulation results show that despite using a less aggressive and simplified probing mechanism - more suitable for inter-domain scenarios - the proposed routing strategy can build multicast trees with metrics similar to those build by more aggressive technics, with considerable less effort