Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints

2014 ◽  
Vol 556-562 ◽  
pp. 5343-5347
Author(s):  
Cheng Zhang ◽  
Wu Ma
Keyword(s):  
Multicast Routing ◽  
Cost Minimization ◽  
Low Complexity ◽  
Multicast Tree ◽  
Selection Function ◽  
The Core ◽  
Core Selection ◽  
And Performance ◽  
Shared Tree ◽  
Delay Variation

The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection

2013 ◽  
Vol 373-375 ◽  
pp. 1182-1187
Author(s):  
Yuan Chen Li ◽  
Wei Qun Liu
Keyword(s):  
Real Time ◽  
Multicast Routing ◽  
Cost Minimization ◽  
Minimum Cost ◽  
Multicast Tree ◽  
Destination Node ◽  
Selection Methods ◽  
Routing Problem ◽  
Core Selection ◽  
Delay Variation

With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. The algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. In addition, this core selection methods achieve a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance, it can also meet the requirements of real-time network communication.

scholarly journals An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation

2010 ◽  
pp. 202-207
Author(s):  
Manoj Kumar Patel ◽  
MANAS RANJAN KABAT ◽  
Chita Ranjan Tripathy
Keyword(s):  
Upper Bound ◽  
Heuristic Algorithms ◽  
Multicast Tree ◽  
End To End Delay ◽  
Tree Generation ◽  
Core Selection ◽  
End To End ◽  
Better Than ◽  
Delay Variation

Many multimedia group applications require the construction of multicast tree satisfying the quality of service (QoS) requirements. To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). The problem is to satisfy the end-to-end delay and delay-variation within an upper bound. The DVBMT problem is known to be NP complete. In this paper, we propose an efficient core selection algorithm for satisfying the end-to-end delay and delay-variation within an upper bound. The efficiency of the proposed algorithm is validated through the simulation. The simulation results reveal that our algorithm performs better than the existing heuristic algorithms.

A Multi-core Shared Tree Algorithm Based on Network Coding for Multi-point Optical Multicast

2015 ◽  
Vol 36 (1) ◽  
Author(s):  
Huanlin Liu ◽  
Yuming Yang ◽  
Yuan Li ◽  
Yong Chen ◽  
Sheng Huang
Keyword(s):  
Network Coding ◽  
Wavelength Division Multiplexing ◽  
Heuristic Method ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Tree Algorithm ◽  
Network Bandwidth ◽  
The Core ◽  
Core Node ◽  
Shared Tree

AbstractWith the growth of multi-point to multi-point multicast applications, the optical network bandwidth resource consumption is increasing rapidly. It attracted more and more researchers to improve the limited wavelength bandwidth utilization for multicast applications in wavelength division multiplexing (WDM) networks. In the paper, a multi-core shared multicast tree algorithm based on network coding is proposed to minimize the fiber link stress. The proposed algorithm includes three processes: searching the core node candidate set excluding core node loop path, selecting the core nodes from the convergence matrix based on heuristic algorithm, and constructing the multi-core nodes shared trees. The convergence matrix based on the heuristic method is constructed for selecting the core nodes from candidate core node set. To improve the limited wavelength utilization, we introduce network coding into the shared tree to compress the transmitting information. The simulation results show that the proposed algorithm’s performance is better than the existing algorithms’ performance in terms of link stress and balance degree.

A Delay-Constrained Multicast Routing Balanced-Optimization Algorithm of Link-Sharing

2012 ◽  
Vol 152-154 ◽  
pp. 1834-1839
Author(s):  
Wei Qun Liu ◽  
Xiang Kui Chen
Keyword(s):  
Computational Complexity ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Multicast Tree ◽  
Selection Function ◽  
Minimum Delay ◽  
The Cost ◽  
Balanced Optimization

In multimedia network, Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay, cost, bandwidth, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time applications where it is necessary to provide bounded delays among the source and all destinations while keeping overall cost of the multicast tree low. So the cost and computational complexity are analyzed as constructing delay-constrained multicast tree. So as to optimize shortest paths, a new algorithm of ORLSB(optimal routing algorithm for link-sharing balance) is proposed.The link selection function of the algorithm not only considers the priority of the destination nodes, but also takes into account the priority of the low delay path based on local information. Because the multicast tree has fewer possible path, the algorithm reduces the probability of creating multicast tree through the minimum delay path and improves the sharing paths. Simulation results show that this algorithm has balanced cost, delay and computational complexity, and has better overall performance.

Construction of MOFs-Shell Porous Materials and Performance Study in Selective Adsorption and Separation of Benzene Pollutants

2021 ◽  
Author(s):  
Yu Qiao ◽  
Na Lv ◽  
Dong Li ◽  
Hongji Li ◽  
Xiangxin Xue ◽  
...  
Keyword(s):  
Porous Materials ◽  
Shell Structure ◽  
Selective Adsorption ◽  
Core Shell ◽  
Architecture Design ◽  
Performance Study ◽  
The Core ◽  
Core Shell Structure ◽  
And Performance ◽  
Sacrificial Agent

Metastable Cu2O is an attractive material for the architecture design of integrated nanomaterials. In this context, Cu2O was used as the sacrificial agent to form the core-shell structure of Cu2O@HKUST-1...

Do Anxious Swimmers Swim Slower? Reexamining the Elusive Anxiety-Performance Relationship

1988 ◽  
Vol 10 (1) ◽  
pp. 45-61 ◽  
Author(s):  
Damon Burton
Keyword(s):  
Low Complexity ◽  
Performance Measure ◽  
Somatic Anxiety ◽  
Self Confidence ◽  
Cognitive Anxiety ◽  
Long Duration ◽  
Two Samples ◽  
And Performance ◽  
Moderate Complexity ◽  
The Relationship

The purpose of this investigation was to utilize a multidimensional measure of anxiety and a more sensitive intraindividual performance measure to evaluate the relationship between anxiety and performance. Three hypotheses were tested. First, cognitive anxiety is more consistently and strongly related to performance than is somatic anxiety. Second, somatic anxiety demonstrates an inverted-U relationship with performance, whereas self-confidence and performance exhibit a positive linear relationship and cognitive anxiety and performance exhibit a negative one. Finally, short duration and high and low complexity events demonstrate stronger relationships between somatic anxiety and performance than do long duration or moderate complexity events. Two samples of swimmers completed the CSAI-2 prior to competition, and performance data were obtained from meet results. Correlational and multiple regression analyses generally supported Hypotheses 1 and 3, while polynomial trend analyses on standardized CSAI-2 scores confirmed trends predicted in Hypothesis 2. Overall, these results not only revealed that improved instrumentation allows demonstration of consistent anxiety-performance relationships, but they also provided additional construct validity for the CSAI-2.

Sign in / Sign up

Export Citation Format

Share Document