An extended core‐based framework for delay‐constrained group communication

Abstract

Multipoint communications is the simultaneous transmission of data streams from a number of sources to a set of receivers in a group according to predetermined metrics. The core-based approach in multipoint communication enhances potential solutions in terms of QoS-efficiency and feasibility of the results in inter and intra-domain routing. In this paper, we first analyze the solution space for constrained multipoint communication problems under the core-based approach. We show that the range of solutions examined by the models proposed to date is restricted to a subset of the entire solution space, which restricts the potential efficiency of the results. We propose SPAN, a core-based framework processing on our identified extended solution space for constrained multi-source group applications. SPAN consists of core selection and tree construction as two modular components complimenting one another to achieve more efficient solutions in distributed processing. SPAN is also asymmetric, hence potentially operates in domains in which link weights are not necessarily equal in both directions. We analyze the computational and message complexity of our framework and show its feasibility for distributed deployment. Our performance results show that SPAN consistently outperforms its counterparts in the literature in terms of cost and QoS-efficiency.

QoS-constrained core selection for group communication

“…Section 3.2 examines the multi-core selection algorithms in literature and first examines n-dominating set and k-center studied in [23] for their Senders-to-Many and Membersto-Many protocols. We then look into GREEDY and NAÏVE [15] and SPAN [10] in this subsection which are the constrained multi-core selection algorithms in literature directly relating to our work. We refer the reader to [12] for a review and analysis of core-based multicast routing algorithms.…”

“…SPAN [10] is a distributed, asymmetric framework that operates in both non-singular and singular solution spaces for QoS-constrained group communication. SPAN initially identifies the potential cores into a pool as candidates by examining their domination characteristics.…”

“…Within our framework [10], we separate the process of tree construction from core selection for modular efficiency of the components in the construction and maintenance of paths in a distributed manner. For tree construction, we modify the SMT heuristic in [19] into a constrained version.…”

“…SPAN [10] conducts its search for cores based solely on the domination count of each core as the selection criterion. In this section, we present two core selection algorithms, COST and ADJUST.…”

“…Core-based QoS-routing solutions proposed to date restricted the processing range to a subset of the solution space, which in turn restricted the efficiency of the potential results [12]. In [10], we proposed a basic core selection algorithm, SPAN, resulting in a distributed, QoS-constrained solutions in the extended solution space under the corebased architecture. SPAN processed solely on the connectivity information each candidate core provides the group members, yet consistently outperformed its counterparts in the literature.…”