Core-selection algorithms in multicast routing - comparative and complexity analysis

Karaman, A.; Hassanein, Hossam S.

doi:10.1016/j.comcom.2005.06.003

Cited by 31 publications

(27 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the cores need to be selected using some core selection heuristic. Several core selection heuristics have been proposed, and a comprehensive study is given by Karaman and Hassanein [18]. An overall goal is to select cores on the basis of certain node properties, such as, bandwidth and computational power.…”

Section: Core Selection Heuristicsmentioning

confidence: 99%

See 1 more Smart Citation

Latency reduction by dynamic core selection and partial migration of game state

Beskow

Vik

Halvorsen

et al. 2008

Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games

View full text Add to dashboard Cite

Massively multi-player online games (MMOGs) require low latency while supporting a large number of concurrent players, often sharing one worldwide instance of the game. As these are conflicting requirements, a common way of distributing load is by dividing the virtual environment into virtual regions. As MMOGs are world-spanning games, it is plausible to disperse these regions on geographically distributed servers. As such, we propose the use of core selection for finding an optimal server for placing a region, and support for migrating the game state to that server. The first goal relies on a set of servers and measurement of the interacting players latencies. In locating an optimal server, we anticipate a decrease in the overall latency for the majority of players. This reduction occurs by migrating the region to a server closer in proximity to the majority of players in that virtual region, thereby lowering the response time of any interaction.

show abstract

Section: Core Selection Heuristicsmentioning

confidence: 99%

“…The graph median is the node for which the sum of lengths of shortest paths to all other vertices's is the smallest. The heuristics are [18]:…”

Section: Core Selection In a Proxy Architecturementioning

confidence: 99%

Latency reduction by dynamic core selection and partial migration of game state

Beskow

Vik

Halvorsen

et al. 2008

Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games

View full text Add to dashboard Cite

show abstract

“…A source willing to deliver its stream simply sends its data packets to the core from whereon they are transmitted to the receivers via the core-trees. In [KH04], we provide a detailed review of these protocols.…”

Section: Previous Workmentioning

confidence: 99%

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

Karaman

Hassanein

2007

Int J Communication

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…The proposed DCS algorithm is a distributed core selection algorithm which has two subsets: (1) multicast session member dominating set (MDS), (2) non-multicast session member dominating set (NDS). In such a way, each node in one-to-many multicast session will be dominated at least twice to enhance the restoration ability.…”

Section: Proceedings Of the International Multiconference Of Engineermentioning

confidence: 99%

“…In source-based mode, multicast tree rooted at the source node and connected to each member in the multicast session [2]. Then, data packets originating from the source node are sent to all the destination nodes via the links of multicast tree.…”

Section: Introductionmentioning

confidence: 99%

One-to-many multicast restoration based on dynamic core-based selection algorithm in WDM mesh networks

et al. 2009

View full text Add to dashboard Cite

Abstract-This paper proposes a novel dynamic core-based selection (DCS) algorithm for the multicast restoration in WDM mesh networks. The core-based fault tolerance scheme provides a flexible way to control a number of core nodes with less control overheads for searching the routing path, wavelength assignment (RWA) and restoration paths when fault occurs in the one-to-many multicast domain. Compared with the source-based scheme, core-based schemes are easier to maintain, and specifically scalable in large-scale topologies. In the core-based fault tolerance scheme, k-tuple domination nodes are selected to form a minimum sized vertex subset such that each vertex in the graph is dominated by at least k vertices, where the k is defined as two in this paper. The proposed DCS algorithm is defined as each node in multicast tree session must be directly connected to at least one core node in multicast tree session and also has to be directly connected to at least one core node out of multicast tree session. The primary aim of this work is to provide the scalable and fast local survivability based on the information from core nodes. Simulation results show that the proposed algorithm outperforms the Dual Tree and MRLR algorithms in terms of total hop counts needed for all recovery paths and blocking probability for different network topologies.

show abstract

Core-selection algorithms in multicast routing - comparative and complexity analysis

Cited by 31 publications

References 6 publications

Latency reduction by dynamic core selection and partial migration of game state

Latency reduction by dynamic core selection and partial migration of game state

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

One-to-many multicast restoration based on dynamic core-based selection algorithm in WDM mesh networks

Contact Info

Product

Resources

About