Papers by Keyword: Multi-Cast

Abstract: Multicast routing technology of Ad hoc network is a method of transferring specific data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. After the analysis of energy model and other routing algorithms ,an energy model and a balanced energy network multicast routing algorithm EBAMRA have been proposed in this article,. Experiments had been done, the simulation results show that this algorithm is feasible and effective, which provides a new and effective way of Ad hoc multicast routing technology.

Abstract: A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

Abstract: In this paper, we study the multicast waveband grooming in multi-domain optical networks and propose three heuristic algorithms, Per-Domain Multicast Grooming (PDMG), Virtual Topology Multicast Grooming (VTMG) and Hierarchical Multi-domain Multicast Grooming (HMMG). Simulation results show that, comparing with PDMG and VTMG, HMMG has the best performance of ports savings and the lowest blocking probability.

Abstract: In this paper, for the shortage of network quality of service, multicast support and other deficiencies in VoD systems based on IPv4 network, we built a P2P VoD system architecture based on IPv6 network and data transfer mechanisms were in-depth studied. This paper describes the basic idea of the system and system architecture. According to the characteristics of P2P and multicast, we designed a collaboration data transmission of P2P and IP multicast and did some experiments and analysis on the system. Experimental results show that the system can effectively solve the P2P bandwidth problem and the unreliable of multicast data, and has high efficiency and practical value.

Abstract: Power consumption of Internet is becoming more and more a sensible problem, which is of interest for both the research community and the general public. In this paper we have formally defined the power-aware multicast VN construction problem and setup an ILP model whose objective is to find a virtual topology on top of substrate network fulfilling all restrictions, while the power consumption of construction is minimized. In order to address the problem efficiently we develop a greedy algorithm: PMVNMH. The efficiency of the power-aware construction algorithm is evaluated by emulation experiment.

Abstract: In order to address some deployment problems of IP multicast, the notion of Multicast Service Overlay Network (MSON) is proposed. How to construct MSON satisfying user’s demand efficiently under the situation of limited resources is a hot issue. In this paper we analyze a mathematics model of MSON construction. Under the objective of finding a virtual topology on top of physical network fulfilling all restrictions, and minimizing the cost of construction while keeping residual physical network the most balanced, an Integer Linear Programming model of the construction problem is depicted. In order to solve the problem efficiently, we propose a heuristics algorithm named BLMH. The efficiency of BLMH is evaluated by emulation experiment according to congestion link number under several scenarios.

Abstract: Distributed routing can find multicast tree and adapt to dynamic changes of multicast members in case of acknowledge local network state. Majority of current distributed multicast routing algorithms based on the shortest delay, which can achieve load balance large additional overhead. The paper presented a kind of load balance multicast routing algorithm based on distributed computation and centralized control. It reside computation Agent in each node to compute forward probability and to maintain node routing table, node state table and forwarding probability table. In addition, it can detect delay of adjacent nodes and coordinate session establishment based on the copy, parameter transmission and notification of control Agent. On this basis, the algorithm achieved dynamically joins and leave session of multicast members. Algorithm analysis results show that the algorithm can improve the overall efficiency of network transmission.

Abstract: The limitations in complexities and extensibilities of current scheduling policies based on combined input and cross-point queuing switch (CICQ) are first analyzed. To overcome the deficiencies in supporting fair and QOS scheduling, we propose a fair and simple high-performance multicast scheduling algorithm for Combined Input Crosspoint Queued Switches, which is called multicast Fair Service and Group Smoothed Round Robin (mFGSR). The complexity of the algorithm is only O(1). mFGSR groups and schedules flows according to the weight of flows, thus it has good fairness and can adapt to the need of real-time performance. Theorotical analysis and simulation results show that mFGSR exhibits good delay, throughput and anti-burst performance.

Abstract: Wireless Multicast is one of the important problems with applications to opportunistic networks, such as delay-tolerant networks (DTNs), personal, pocket-switched networks (PSNs) etc. Network Coding has received many attentions because it improves potential network throughput and robustness by the way of combining multiple packets in the routers and reducing the transmissions. This paper combines network coding with opportunistic routing to improve the throughput of wireless multicast, where an Inter-coding and Intra-coding scheme is introduced to the traditional multicast routing algorithm (OR-DNC, Opportunistic Routing with Dual Network Coding). Compared with traditional multicast routing without coding and MORE-M, OR-DNC performs better in terms of throughput, transmission reduction and coding gain.

Abstract: IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.