4 research outputs found

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

    Get PDF
    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

    QoS-constrained core selection for group communication

    No full text
    The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in inter and intra-domain routing. In an earlier work [KH04], we showed that the constrained cost minimization solutions in core-based approach proposed to date are restrictive in their search to a subrange of solutions, and we proposed SPAN, a generic framework to process in our identified extended solution space. In this paper, we study the core selection component of SPAN and propose two novel algorithms, SPAN/COST and SPAN/ADJUST, which define the core-selection component of SPAN. SPAN/COST mainly optimizes the cost distances to be traveled between the source-core and core-receiver pairs on the multicast trees, while SPAN/ADJUST selects the cores based on the numbers of nodes they dominate and adjusting the set based on cost. Our algorithms consistently outperform their counterparts proposed to date and can be considered pioneering in their optimization range of multiple metrics and processing in the extended solution space.Publisher's Versio

    QoS-constrained core selection for group communication,”Comput

    No full text
    Abstract The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in interand intra-domain routing. In an earlier work [A. Karaman, H.S. Hassanein, Extended QoS-framework for Delay-constrained Group Communication, International Journal of Communication Systems, in press.], we showed that the constrained cost minimization solutions in core-based approach proposed to date are restrictive in their search to a subrange of solutions, and we proposed SPAN, a generic framework to process in our identified extended solution space. In this paper, we study the core selection component of SPAN and propose two novel algorithms, SPAN/COST and SPAN/ADJUST, which define the core-selection component of SPAN. SPAN/COST mainly optimizes the cost distances to be traveled between the source-core and core-receiver pairs on the multicast trees, while SPAN/ADJUST selects the cores based on the numbers of nodes they dominate and adjusting the set based on cost. Our algorithms consistently outperform their counterparts proposed to date and can be considered pioneering in their optimization range of multiple metrics and processing in the extended solution space
    corecore