The Ordered Core Based Tree Protocol
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multicast routing for real-time communication of high-speed networks
Multicast routing for real-time communication of high-speed networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Energy-efficient geographic multicast routing for Sensor and Actuator Networks
Computer Communications
An extended core-based framework for delay-constrained group communication: Research Articles
International Journal of Communication Systems
Core-selection algorithms in multicast routing - comparative and complexity analysis
Computer Communications
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Efficient group multicast node scheduling schemes in multi-hop wireless networks
Computer Communications
Hi-index | 0.24 |
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 [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.