Multicast Architecture Research Articles

Optimization of manufacturing processes by distributed simulation

The paper describes a simulation-based optimization system for manufacturing processes. The principle suitability of simple Threshold Accepting and Great Deluge Algorithms for optimizing practical manufacturing systems is shown, as well as the possibility of parallelizing of these algorithms. A special IP Multicast architecture is introduced which allows the simulation model to be extended to multiple clients and so the efficiency of the optimization algorithms to be increased by concurrent simulation. Each client can log on or log out at an optimization server at any time so that it should be possible to use the idle computer capacity of a single production department or a whole company. The optimization server is implemented as an experimental option in the simulation system simcron MODELLER®, which is particularly used in electronics and semiconductor manufacturing.

Real-time scheduling by parallel and distributed simulation over IP Multicast

Scheduling optimization of manufacturing processes becomes more and more important. Complex models with a lot of constraints cause a higher computational effort of the simulation. Optimization cycles of heuristic optimization algorithms like genetic algorithms or local search strategies can easily be scheduled in parallel. But recurrent requirements are the distribution of the model, the interchange of the parameters and results. The IP Multicast architecture is an ideal platform for distributing model data over the network. It reduces the network overhead for sending the model to different clients and simplifies also the initial setup between client and server. The client and the server are able to find each other automatically by preconcerted multicast channels. The developed test implementation is designed to work with the simulation system simcron MODELLER and will be used to handle typical optimization tasks like the weekly demand plan of a back-end process or optimal batch sizes for burn-in ovens. It is also suitable for educational purposes and we use it in practical courses where students learn more about factory scheduling. The system offers a high reusability for any operating sequence optimization problem in electronic or semiconductor manufacturing industry, as well as in other fields.

A Novel Multistage Network Architecture with Multicast and Broadcast Capability

In this paper, a new class of optical multistage interconnection network (MIN) architecture is presented, which is constructed utilizing a modularization approach rather than the traditional recursive or fixed exchange pattern methods. The modified architecture consists of an input module, an output module, two point-to-point (PTP) modules, and one modified multicast/broadcast (M/B) module(s). We also implement the multicast/broadcast module with WDM technique, which reduces the hardware cost required for multicast and the re-computation cost for a new connection. We show that it has the best application flexibility and provides multicast function without imposing significant negative impacts on the whole network. A new multicast connection pattern is also proposed in this paper, which makes it practical and economical to apply amplification in space-division networks. Compared with existing multicast architectures, this new architecture with Dilated Benes PTP modules has better performance in terms of system SNR, the number of switch elements, and system attenuation in point-to-point connections. Moreover, the multicast/broadcast module adopts wavelength division multiplexing (WDM) technique to increase its multicast/broadcast assignment. As a result, given m available distinguished wavelengths, one M/B module can support at most m M/B requests at the same time. The new proposed M/B module with WDM is more practical and economical to apply amplification in space-division networks.

Distributed Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks

This paper proposes a set of novel distributed algorithms on m-D mesh overlay configurations for short delay and low resource consumption application layer multicast. In contrast to previous approaches, our application layer multicast adopts two-layer tree architecture and the novelty and contribution are: (1) cluster formation algorithm assigns the closest group members into the same cluster that greatly decreases the multicast delay and resource consumption caused by the message transmission among the members with long distances; (2) optimal core selection algorithm seeks the cluster member who has the minimum sum of static delay distances to other cluster members as the optimal cores (i.e. cluster cores) that guarantees the short multicast delay; (3) weighted shortest path tree generation algorithm constructs a shortest path tree rooted at the optimal core for each cluster. The shortest path tree utilizes the minimum sum of links that are on the shortest paths among the cluster members; and (4) distributed multicast routing algorithm directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. The extended simulation results indicate that the application layer multicast constructed by our algorithms is efficient in terms of short multicast delay and low network resource consumption as compared with other well-known existing multicast solutions.

A Fast Multicast Handoff Based Hierarchical Mobile Multicast Architecture

Mobile communication is playing an increasing role in our lives. Mobile users expect similar kinds of applications to static ones. Multicast not only brings attractive applications, but also has the benefit of saving scarce bandwidth in wireless environment. It would be fruitful to combine these two technologies. This paper proposes a framework to provide multicast in mobile environment called Fast Multicast Handoff Based Hierarchical Mobile Multicast Architecture (FHMM). It uses a hierarchical mobile multicast architecture to isolate the local movement from outside, and improve the stability of the main multicast delivery tree. It introduces a fast multicast handoff mechanism which can reduce handoff latency and packet loss rate for inter-domain handoff and intra-domain handoff. Furthermore, FHMM is a universal solution because it can still work even if the access network does not support multicast. Simulation results show that FHMM is effective with low packet loss rate, high multicast packet

Improving the reliability of IEEE 802.11 broadcast scheme for multicasting in mobile ad hoc networks

Broadcasting is one of the essential communication models of MANETs. Many MANET multicast routing protocols rely heavily upon MAC layer's broadcast service for data delivery, multicast architecture construction and maintenance. However, the broadcast mechanism of the IEEE 802.11 standards cannot provide reliable broadcasting support, and therefore, satisfactory performance of the multicast protocols cannot be guaranteed. An extension to IEEE 802.11 broadcast mechanism, called round-robin acknowledge and retransmit, to address this shortcoming is proposed. Different from other mechanisms, we employ a simple and effective acknowledge mechanism, in which the lost frames are reported by neighbouring nodes in a round-robin style to avoid the notorious ack explosion problem. A MAC layer retransmission scheme is then provided for the lost frames. By varying the traffic load and group size, under the on demand multicast routing protocol (ODMRP), extensive simulations show that the proposed scheme provides a highly reliable broadcast service to the routing layer, and ODMRP's performance is improved significantly.

End-host controlled multicast routing

The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast functionality provided by specialized network nodes, or host-based, with the multicast functionality provided by the members of the multicast group itself. In this paper, we present the design and evaluation of a hybrid multicast architecture wherein the infrastructure provides packet forwarding, and the end-hosts implement the control plane. End-hosts build multicast trees by setting up forwarding state in the infrastructure. This division of functionality enables our architecture to combine the efficiency of infrastructure-based solutions and the flexibility and deployability of host-based solutions. We present scalable and efficient algorithms for distributed tree construction and maintenance, and for reliable packet delivery. We have implemented the algorithms using i3 as the forwarding infrastructure. We evaluate our techniques using a combination of event-driven packet-level simulations, and our implementation over the PlanetLab testbed.

A real-time video multicast architecture for assured forwarding services

This paper presents our work on developing an architecture for multicasting real-time MPEG4 over IP networks that provide service differentiation. In particular, this work is targeted at assured forwarding (AF) style services. This work is an attempt to find a simple solution to the problem of multicast congestion control of real-time traffic by exploiting the service differentiation capabilities of AF networks. Our architecture assumes loss differentiation in the network and assumes the network's ability to provide explicit congestion notification messages to the sender. We do not consider policing/shaping at the edge routers. Rather, we consider a more general case where packet marking and flow control are provided at the senders. For this network model, we built an end-to-end architecture and developed a rate-adaptation algorithm that can operate in both unicast and multicast applications with a minor modification. The simulation results show how the rate-adaptation algorithm accommodates different receivers with different networking capabilities and provides receivers with different levels of quality by taking advantage of the queue management capabilities of the AF service. We test how the architecture scales to a large number of receivers, how multiple multicast sessions interact, and how it interacts with TCP.

A Receiver Authentication and Group Key Delivery Protocol for Secure Multicast

We propose receiver authentication and group key delivery protocol (AKDP) to realize secure multicast communication. AKDP provides three principal functions: 1) group key delivery for data confidentiality, 2) receiver access control to cope with denial of service and 3) receiver authentication for user accounting. AKDP has a negotiation function to choose and offer only those functions required by the situation. We evaluate the feasibility of AKDP by developing a prototype system and show that total communication time is acceptable (i.e. 406 ms). We also show that the negotiation function of AKDP reduces total communication time because unnecessary functions can be skipped. We demonstrate that the negotiation function reduces the total communication time by 52% if user accounting is not executed. We also find that the scalability of group control and key server is not insignificant if multiple receivers access it simultaneously; however, we also propose a secure multicast architecture that can accommodate multiple servers and so guarantee scalability.

모바일 애드혹 네트워크를 위한 링 기반 멀티캐스트 라우팅 구조

예상치 못한 에드혹 망의 접속형태의 변경이 동반되는 멀티캐스트 라우팅 프로토콜에 대한 연구에 많은 과제를 남겨놓고 있으며, 다양한 이동 에드혹 망에 적합한 프로토콜에 대한 연구의 필요성이 제기되고 있다. 본 논문에서는 계층적 Eulerian 링 멀티캐스트 구조를 갖는 새로운 프로토콜을 제안한다. 제안한 구조는 Eulerian 링, 계층구조, 멀티캐스트 에이전트를 갖으며 기존의 방법보다 효율적이며 안전한 특성을 갖는다. 제안한 구조는 트리기반 및 메시기만 멀티캐스트 프로토콜과 비교하여 제어트래픽의 양, 점대점 지연, 패킷전송률 등에 있어 우수함은 시뮬레이션을 통해 입증한다. Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in mobile ad hoc network. In this paper, we propose a novel scheme of Hierarchical Eulerian Ring Oriented Multicast Architecture (HEROMA) over mobile ad hoc network. It has features that concentrate on efficiency and robustness simultaneously. It is also an application-driven proposal for hazard detection. Architectures including Eulerian ring, hierarchy and multicast agent are investigated in detail Simulation results different level of improvements on control traffic, end-to-end delay and packet delivery ratio by comparing with tree-based and mesh-based multicast protocols.

공유 트리 기반 멀티캐스트 라우팅을 위한 코어 선택 방법

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member`s arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.

MPLS망을 이용한 인터넷 멀티캐스트 라우팅 프로토콜 모델

본 논문은 MPLS(Multiprotocol Label Swtiching) 망에서 인터넷 멀티캐스트 라우팅 프로토콜을 지원하기 위한 방안을 제시한다. 인터넷 멀티캐스트 라우팅 프로토콜은 트리의 구성방식과 속성에 따라 최단거리트리 방식, 공유트리 방식 및 복합트리 방식 등으로 분류된다. 각 방식에 따라 MPLS 망에서 지원해야 하는 기능이 달라진다. 특히, 단/양방향성 트리 링크, Flooding/Prune 방식의 트리 구성, 하나의 멀티캐스트 그룹에 다중 트리의 존재 등 여러 가지 미해결이거나 해결하기 어려운 문제점들이 존재한다. 본 논문에서는 몇가지 가정을 세우고, 이를 바탕으로 각 멀티캐스트 라우팅 프로토콜을 MPLS 망에서 지원하기 위한 방안을 제시한다. Flooding/Prune 방식의 멀티캐스트 라우팅 프로토콜에 대해서는 새로이 브로드캐스팅용의 레이블을 정의하여 해결하고, 공유트리 방식에 대해서는 기 제안된 블록기반 멀티캐스트 전송기법을 도입하여 셀 인터리빙(Call Interleaving) 문제를 해결하며, 마지막으로 복합트리 방식에 대해서는 기존 멀티캐스트 라우팅 프로토콜에 수정된 SPT 전환 기능을 추가하므로써 MPLS 지원문제를 해결한다. 제안하는 방법이 기존의 방법보다 비교해 보았을 때 전송지연에서 우수한 성능을 보임을 모의 실험을 통해서 확인하였다. This paper describes the new method for Internet multicast routing protocols using MPLS (Multiprotocol Label Switching) networks. Internet multicast routing protocols are divided into three categories in terms if tree types and tree characteristics : a shortest path tree a shared tree and hybrid tree types. MPLS should support various multicast mechanisms because of extremely different IP multicast architectures, such as uni-/bi-directional link, Flooding/prune tree maintenance mechanism. the existence of different tree types with the same group, etc. There are so many problems over MPLS multicast that the solutions can't be easily figured out. In this Paper, we make a few assumptions on which the solutions of IP multicast routing protocols over MPLS networks are given. A broadcasting label is defined for the shortest path tree types. Cell interleaving problems of the shared tree types is solved by using block-based transmission mechanism. Finally, the existing hybrid-type multicast routing protocol is reasonably modified Shortest Path tree type to support MPLS multicast. It has been shown that these modifications give better performance (transmission delay) than the orignal method.

Rendezvous point relocation in protocol independent multicast - sparse mode

Protocol independent multicast - sparse mode is the most widely used multicast routing architecture. It builds a shared distribution tree centered at a rendezvous point and then builds source-specific trees for those sources whose data rate warrants it. Current implementations of the protocol decide on the rendezvous point administratively, which leads to congestion and delays. An attractive solution would be dynamic relocation of the rendezvous point depending on the members of the multicast group. We present a rendezvous point calculation and relocation mechanism for protocol independent multicast -sparse mode. Simulation of the proposed mechanisms is used to demonstrate the effectiveness of the proposals.

안전한 멀티캐스트 서비스 제공을 위한 효율적인 그룹 관리 메커니즘 및 구조

멀티캐스트 서비스들이 점차 다양해지고, 서비스 사용자의 폭도 넓어지고 있다. 이에 비례하여 공격자들의 주목을 받게되고 정보의 누출 가능성도 높아진다. 따라서 멀티캐스트 서비스 활용과 동시에 그에 대한 보안 연구도 함께 이루어져야 한다. 본 논문에서는 멤버의 동적인 가입 탈퇴가 발생하는 그룹에서 효율적인 그룹 관리를 적용하여 안전한 멀티캐스트 서비스를 제공할 수 있는 구조를 제안한다. 제안한 구조는 한 명의 송신자와 다수의 수신자로 구성된 멀티캐스트 통신 상황에서, 보안 측면을 고려하여 많은 이용자들에게 안전한 멀티캐스트 서비스를 제공할 수 있다. 시뮬레이션을 통하여 기존의 구조와 성능을 비교·분석한 결과, 제안하는 구조는 멤버 관리가 효율적이고, 전송 지연을 줄이면서 보다 안전하게 데이터를 전송할 수 있다는 것을 알 수 있었다. Multicast services are gradually diversified and used widely. Proportionately, they become the center of attackers' attention and there are growing possibilities of an intelligence leak. Therefore, research related to secure multicast should be required to provide multicast service efficiently. This paper presents the architecture for secure multicast which provides efficient group management mechanism in group consists using member's dynamic join and leave. This architecture can provide secure multicast services to many users with regard to security aspects in one-to-many communication. The simulation results show that the proposed architecture achieves an efficient group management and a secure data transmission with low latency compared with the other existing secure multicast architecture.

A secure multicast protocol with copyright protection

We present a simple, efficient, and secure multicast protocol with copyright protection in an open and insecure network environment. There is a wide variety of multimedia applications that can benefit from using our secure multicast protocol, e.g., the commercial pay-per-view video multicast, or highly secure military intelligence video conference. Our secure multicast protocol is designed to achieve the following goals. (1) It can run in any open network environment. It does not rely on any security mechanism on intermediate network switches or routers. (2) It can be built on top of any existing multicast architecture. (3) Our key distribution protocol is both secure and robust in the presence of long delay or membership message. (4) It can support dynamic group membership, e.g., JOIN/LEAVE/EXPEL operations, in a network bandwidth efficient manner. (5) It can provide copyright protection for the information provider. (6) It can help to identify insiders in the multicast session who are leaking information to the outside world. We have implemented a prototype system which validates our secure multicast protocol and evaluated it against various performance matrices. The experimental results are very encouraging, but also show where new engineering approaches need to be deployed to conform fully to the design goals.

Internet multicast routing and transport control protocols

Multicasting is a mechanism to send data to multiple receivers in an efficient way. We give a comprehensive survey on network and transport layer issues of Internet multicast. We begin with an introduction to the current Internet protocol multicast model-the "host group" model and the current Internet multicast architecture, then discuss in depth the following three research areas: (1) scalable multicast routing; (2) reliable multicast; and (3) multicast flow and congestion control. Our goal is to summarize the state of the art in Internet multicast and to stimulate further research in this area.

Analytical models for Replicate-At-Send multicasting in shared-memory switches

Shared-memory switches are still in commercial use and in the future will possibly be used in large-scale multistage architectures. The need to handle multicasting is also growing. In this paper analytical models are presented for shared-memory switches with the Replicate-At-Send-distinct address queue multicast scheme. Models for both Random (Bernoulli) and Bursty (Correlated) traffic sources are presented. The models are accurate for various loads, with different ratios of multicast traffic and a range of fanout sizes. They can be further extended to analyse more complex multicast schemes or multistage architectures.

Efficient architectures and algorithms for multicasting data in computer communication networks

This paper presents two network architectures with associated routing and multicast algorithms for improved performance under multicasting traffic conditions. A conditionally nonblocking network, referred to as a Clos network, forms the basis for the development of efficient multicast communication networks. The Clos network is first analyzed under multicast traffic conditions for blocking and multicast overflow probability. The analysis determines the overflow probability under two different multicast distribution assumptions. The first distribution assumes all packets request the same number of copies and the second distribution uses a random number of requested copies. An analysis of an extension of the presented network to multiplexed parallel planes of a network shows a significant improvement on the network performance and particularly on the carried traffic load when compared with previously published multicast architectures using different buffering strategies.

A survey of data multicast techniques, architectures, and algorithms

This article presents a survey of architectures, techniques, and algorithms for multicasting data in communication switching networks. We start with a broadcast architecture using a separate copy network and a routing network. A few versions of this idea using Delta and Benes networks exist. Another multicast architecture is a recycling network where internal nodes act as relay points, accept packets from the switching fabric, and recycle them back into the fabric after relabeling the packets. Next, we give an overview of a system that uses the Boolean splitting multicast algorithm. In this system a nonblocking self routing broadcast banyan copy network has been proposed. The network consists of several components including a running adder network to generate running sums of copy numbers specified in the headers of input packets. We then describe a multicasting technique presented for a different class of switching networks called deflection-routing networks. Finally, the idea of extending a nonblocking network to a three-dimensional structure consisting of multiple parallel planes is also presented. At the end of this article, we compare the efficiencies of the presented multicast architectures.

Scalable layered MPEG-2 video multicast architecture

Nowadays, multimedia systems disseminating real-time video information over the Internet are becoming increasingly popular. However, the heterogeneity of network components and end systems, and the lack of congestion control in the Internet pose a major challenge in delivering video. In this paper, a layered multicast architecture is presented to achieve efficient distribution of MPEG-2 video streams over the Internet. The video data is partitioned in a hierarchical manner and transmitted in different multicast channels. The participants automatically subscribe to a number of channels based upon the network congestion and the capabilities of the end systems. This architecture provides scalability on both bandwidth availability level and on the end system capability level.