No 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.

No abstract

No abstract

Traffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraintbased routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms.