QoS-constrained core selection for group communication

Karaman, A.; Hassanein, H.

doi:10.1016/j.comcom.2007.01.011

Cited by 5 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent research in multicast protocols includes multi-core multicast trees by k-center or r-dominating [11,12] with multiple cores nodes selection [13][14][15][16] which can enhance the solution space in terms of QoS-efficiency of solutions in interand intra-domain routing.…”

Section: Multicast Routingmentioning

confidence: 99%

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

et al. 2010

View full text Add to dashboard Cite

Internet Service Providers (ISP) need to support Quality-of-Service (QoS) constrains in Internet multicast applications which are often delay-sensitive and demanding on network resources. This paper proposes a QoS-constraint multicast restoration scheme in WDM mesh networks based on 2-tuple domination core node selection algorithm which minimization of total network resources in "hop-count" as metric while meeting the "delay-constraint" as a second metric. The primary aim of this work is to provide fast inter-and intra-domain routings and steady local survivability with QoS-constraints based on the information obtained from the core nodes. Our simulation results show that the proposed algorithm outperforms the Dual Tree and MRLR algorithms in terms of the minimum restoration time needed for all recovery paths, blocking probability based on the minimum restoration time, instead of minimum hop count in our previous study [1], for different network topologies.

show abstract

Section: Multicast Routingmentioning

confidence: 99%

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

et al. 2010

View full text Add to dashboard Cite

show abstract

“…We have tested the performance of our proposed heuristics against GREEDY (Salama, 1996), the most prominent algorithm for the QoS-constrained many-to-many problem in question, as well as against SPAN (Karaman & Hassanein, 2007a) and its extensions SPAN/COST and SPAN/ADJUST (Karaman & Hassanein, 2007b), which to the best of our knowledge offer the best performance in terms of cost metrics known in the literature. The test network was created with the nem network topology generator (Magoni, 2002) and Waxman model (Waxman, 1988).…”

Section: Computational Experimentsmentioning

confidence: 99%

“…The most popular approach for this QoS-constrained many-to-many problem is GREEDY, a procedure proposed by Salama (1996), which operates in a symmetric, centralized deployment. A major improvement to GREEDY is the SPAN framework (Karaman & Hassanein, 2007a) and its extensions (Karaman & Hassanein, 2007b), which has consistently shown better perfromance than other approaches in the literature. SPAN is a generic core-based framework for asymmetric, decentralized delayconstrained multicast routing in multi-source groups that consists of core selection and tree construction modules.…”

Section: Introductionmentioning

confidence: 99%

“…In the next section, we present the computational experiments associated with 18 different versions of solutions procedures obtained by combining the components that we have described above. The core selection based on GRASP may be configured in 9 different ways by choosing from three costs estimates (i.e., cost 1 , cost 2 and cost 3 ) and three local searches: none, VNS and SPAN/ADJUST (as proposed by Karaman & Hassanein, 2007b). These coreselection procedures are then combined with two ways of constructing the corresponding trees: SMT and SMT-reverse.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Core-Based GRASP for Delay-Constrained Group Communications

Lukač

Laguna

2013

International Journal of Applied Metaheuristic Computing

View full text Add to dashboard Cite

The recent development in network multimedia technology has created numerous real-time multimedia applications where the Quality-of-Service (QoS) requirements are quite rigorous. This has made multicasting under QoS constraints one of the most prominent routing problems. The authors consider the problem of the efficient delivery of data stream to receivers for multi-source communication groups. Efficiency in this context means to minimize cost while meeting bounds on the end-to-end delay of the application. The authors adopt the multi-core approach and utilize SPAN (Karaman and Hassane, 2007)—a core-based framework for multi-source group applications — as the basis to develop greedy randomized adaptive search procedures (GRASP) for the associated constrained cost minimization problem. The procedures are tested in asymmetric networks and computational results show that they consistently outperform their counterparts in the literature.

show abstract

“…Source based tree SBT or Shortest Path Tree SPT is composed of the shortest paths between the source as root and each receivers of multicast group. The main motivations behind using a source based tree SBT are the simplicity of building in a distributed manner using only the unicast routing information [13], [14], and optimization of transmission delay between source and each receiver [6]. The main drawbacks of SBT are: additional costs for maintaining SBT trees, and the number of statements to be stored in the nodes.…”

Section: Introductionmentioning

confidence: 99%

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

Baddi

Kettani²

2022

Int. j. commun. netw. inf. secur.

View full text Add to dashboard Cite

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.

show abstract

QoS-constrained core selection for group communication

Cited by 5 publications

References 20 publications

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

Core-Based GRASP for Delay-Constrained Group Communications

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

Contact Info

Product

Resources

About