The Experts below are selected from a list of 5490 Experts worldwide ranked by ideXlab platform
Mark Handley - One of the best experts on this subject based on the ideXlab platform.
-
The Multicast Address-Set Claim (MASC) Protocol
2000Co-Authors: Pavlin Radoslavov, Mark Handley, Deborah Estrin, Ramesh Govindan, Satish K.s. Kumar, David G. ThalerAbstract:This document describes the Multicast Address-Set Claim (MASC) protocol which can be used for inter-domain Multicast Address set allocation. MASC is used by a node (typically a router) to claim and allocate one or more Address prefixes to that node's domain. While a domain does not necessarily need to allocate an Address set for hosts in that domain to be able to allocate group Addresses, allocating an Address set to the domain does ensure that inter-domain group- specific distribution trees will be locally-rooted, and that traffic will be sent outside the domain only when and where external receivers exist.
-
The Internet Multicast Address Allocation Architecture
2000Co-Authors: David G. Thaler, Mark Handley, Deborah EstrinAbstract:This document proposes a Multicast Address allocation architecture (MALLOC) for the Internet. The architecture is modular with three layers, comprising a host-server mechanism, an intra-domain server- server coordination mechanism, and an inter-domain mechanism.
-
session directories and scalable internet Multicast Address allocation
ACM Special Interest Group on Data Communication, 1998Co-Authors: Mark HandleyAbstract:A Multicast session directory is a mechanism by which users can discover the existence of Multicast sessions. In the Mbone, session announcements have also served as Multicast Address reservations - a dual purpose that is efficient, but which may cause some side-affects as session directories scale.In this paper we examine the scaling of Multicast Address allocation when it is performed by such a Multicast session directory. Despite our best efforts to make such an approach scale, this analysis ultimately reveals significant scaling problems, and suggests a new approach to Multicast Address allocation in the Internet environment.
-
the masc bgmp architecture for inter domain Multicast routing
ACM Special Interest Group on Data Communication, 1998Co-Authors: Satish K.s. Kumar, Pavlin Radoslavov, Deborah Estrin, David G. Thaler, Cengiz Alaettinoglu, Mark HandleyAbstract:Multicast routing enables efficient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, rather than providing mechanisms to realize inter-domain Multicast on a global scale in the Internet.We describe an architecture for inter-domain Multicast routing that consists of two complementary protocols. The Multicast Address-Set Claim (MASC) protocol forms the basis for a hierarchical Address allocation architecture. It dynamically allocates to domains Multicast Address ranges from which groups initiated in the domain get their Multicast Addresses. The Border-Gateway Multicast Protocol (BGMP), run by the border routers of a domain, constructs inter-domain bidirectional shared trees, while allowing any existing Multicast routing protocol to be used within individual domains. The resulting shared tree for a group is rooted at the domain whose Address range covers the group's Address; this domain is typically the group initiator's domain. We demonstrate the feasibility and performance of these complementary protocols through simulation.This architecture, together with existing protocols operating within each domain, is intended as a framework in which to solve the problems facing the current Multicast Addressing and routing infrastructure.
-
SIGCOMM - Session directories and scalable Internet Multicast Address allocation
Proceedings of the ACM SIGCOMM '98 conference on Applications technologies architectures and protocols for computer communication - SIGCOMM '98, 1998Co-Authors: Mark HandleyAbstract:A Multicast session directory is a mechanism by which users can discover the existence of Multicast sessions. In the Mbone, session announcements have also served as Multicast Address reservations - a dual purpose that is efficient, but which may cause some side-affects as session directories scale.In this paper we examine the scaling of Multicast Address allocation when it is performed by such a Multicast session directory. Despite our best efforts to make such an approach scale, this analysis ultimately reveals significant scaling problems, and suggests a new approach to Multicast Address allocation in the Internet environment.
David A Wood - One of the best experts on this subject based on the ideXlab platform.
-
Multicast snooping a new coherence method using a Multicast Address network
International Symposium on Computer Architecture, 1999Co-Authors: Ender E Bilir, Ross M Dickson, Manoj Plakal, Daniel J Sorin, Mark D Hill, David A WoodAbstract:This paper proposes a new coherence method called "Multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a Multicast "mask." Transactions are delivered with an ordered Multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol, while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit Multicasts to an average of 2-6 destinations (ll 32) and we can deliver 2-5 Multicasts per network cycle (gg broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that Multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories).
-
ISCA - Multicast snooping: a new coherence method using a Multicast Address network
1999Co-Authors: Ender E Bilir, Ross M Dickson, Manoj Plakal, Daniel J Sorin, Mark D Hill, David A WoodAbstract:This paper proposes a new coherence method called "Multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a Multicast "mask." Transactions are delivered with an ordered Multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol, while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit Multicasts to an average of 2-6 destinations (ll 32) and we can deliver 2-5 Multicasts per network cycle (gg broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that Multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories).
Dimitris Anastassiou - One of the best experts on this subject based on the ideXlab platform.
-
Address management and connection control for Multicast communication applications
International Conference on Computer Communications, 1995Co-Authors: Alexandros Eleftheriadis, S. Pejhan, Dimitris AnastassiouAbstract:An architecture and associated protocols are presented for managing Multicast Addresses and performing connection control for Multicast communication applications. A scheme to partition the Multicast Address space on the basis of the network number is proposed (an underlying IP-based internetworking environment is assumed), and its performance and scaling characteristics are discussed. A protocol is then developed to provide for dynamic allocation and release of Multicast Addresses, as well as maintaining state information for a connection. The protocol is independent of the Address partitioning scheme; it is also shown to be robust and efficient. Finally, we describe two different mechanisms that enable the use of a common port number by all session participants.
-
Distributed Multicast Address management in the global Internet
IEEE Journal on Selected Areas in Communications, 1995Co-Authors: S. Pejhan, Alexandros Eleftheriadis, Dimitris AnastassiouAbstract:We describe a distributed architecture for managing Multicast Addresses in the global Internet. A Multicast Address space partitioning scheme is proposed, based on the unicast host Address and a per-host Address management entity. By noting that port numbers are an integral part of end-to-end Multicast Addressing we present a single, unified solution to the two problems of dynamic Multicast Address management and port resolution. We then present a framework for the evaluation of Multicast Address management schemes, and use it to compare our design with three approaches, as well as a random allocation strategy. The criteria used for the evaluation are blocking probability and consistency, Address acquisition delay, the load on Address management entities, robustness against failures, and processing and communications overhead. With the distributed scheme the probability of blocking for Address acquisition is reduced by several orders of magnitude, to insignificant levels, while consistency is maintained. At the same time, the Address acquisition delay is reduced to a minimum by serving the request within the host itself. It is also shown that the scheme generates much less control traffic, is more robust against failures, and puts much less load on Address management entities as compared with the other three schemes. The random allocation strategy is shown to be attractive primarily due to its simplicity, although it does have several drawbacks stemming from its lack of consistency (Addresses may be allocated more than once). >
-
INFOCOM - Address management and connection control for Multicast communication applications
Proceedings of INFOCOM'95, 1Co-Authors: Alexandros Eleftheriadis, S. Pejhan, Dimitris AnastassiouAbstract:An architecture and associated protocols are presented for managing Multicast Addresses and performing connection control for Multicast communication applications. A scheme to partition the Multicast Address space on the basis of the network number is proposed (an underlying IP-based internetworking environment is assumed), and its performance and scaling characteristics are discussed. A protocol is then developed to provide for dynamic allocation and release of Multicast Addresses, as well as maintaining state information for a connection. The protocol is independent of the Address partitioning scheme; it is also shown to be robust and efficient. Finally, we describe two different mechanisms that enable the use of a common port number by all session participants.
Daniel Zappala - One of the best experts on this subject based on the ideXlab platform.
-
The Multicast Address allocation problem: theory and practice
Computer Networks, 2004Co-Authors: Daniel Zappala, Chris GauthierdickeyAbstract:In this paper, we perform the first comprehensive study of the Multicast Address allocation problem. We analyze this problem both within its context as a classic resource allocation problem and with respect to its practical use for Multicast Address assignment. We define a framework for the problem, introduce complexity results, and formulate several new allocation algorithms. Despite the theoretical superiority of these algorithms, our performance evaluation demonstrates that a common, prefix-based algorithm is better under a range of workloads. We conclude by illustrating the conditions under which dynamic Address allocation should be used and provide insight into how to further improve the performance of prefix-based allocation.
-
modeling the Multicast Address allocation problem
Global Communications Conference, 2002Co-Authors: Daniel Zappala, Chris GauthierdickeyAbstract:To support IP Multicast, domains must assign a unique Multicast Address to each application from a limited, globally-shared Address space. We examine the performance of several classes of Address allocation algorithms within the context of the MASC architecture. This study is the first of its kind to model the generalized Multicast Address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefit of using worst-fit for new allocations.
-
a theoretical framework for the Multicast Address allocation problem
Global Communications Conference, 2002Co-Authors: Daniel Zappala, Chris Gauthierdickey, T. SingerAbstract:The Multicast Address allocation problem requires Internet domains to allocate unique Addresses to Multicast applications from a globally-shared space. We develop a theoretical framework for Multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the Address allocation problem and describe several new allocation algorithms that use a hypercube model for Address representation.
-
cyclic block allocation a new scheme for hierarchical Multicast Address allocation
Lecture Notes in Computer Science, 1999Co-Authors: Marilynn Livingston, Daniel Zappala, Kurt J WindischAbstract:This paper presents a new hierarchical Multicast Address allocation scheme for use in interdomain Multicast. Our scheme makes use of masks that are contiguous but not prefix-based to provide significant improvements in performance. Our Cyclic Block Allocation (CBA) scheme shares some similarities with both Reverse Bit Expansion and kampai, but overcomes many shortcomings associated with these earlier techniques by exploiting techniques from the area of subcube allocation for hypercubes. Through static analysis and dynamic simulations, we show that CBA has the following characteristics that make it an excellent candidate for practical use in interdomain Multicast protocols: better Address utilization under dynamic requests and releases than other schemes; low blocking time; efficient routing tables; Addresses reflect domain hierarchy; and compatibility with MASC architecture.
-
Networked Group Communication - Cyclic Block Allocation: A New Scheme for Hierarchical Multicast Address Allocation
Lecture Notes in Computer Science, 1999Co-Authors: Marilynn Livingston, Daniel Zappala, Kurt J WindischAbstract:This paper presents a new hierarchical Multicast Address allocation scheme for use in interdomain Multicast. Our scheme makes use of masks that are contiguous but not prefix-based to provide significant improvements in performance. Our Cyclic Block Allocation (CBA) scheme shares some similarities with both Reverse Bit Expansion and kampai, but overcomes many shortcomings associated with these earlier techniques by exploiting techniques from the area of subcube allocation for hypercubes. Through static analysis and dynamic simulations, we show that CBA has the following characteristics that make it an excellent candidate for practical use in interdomain Multicast protocols: better Address utilization under dynamic requests and releases than other schemes; low blocking time; efficient routing tables; Addresses reflect domain hierarchy; and compatibility with MASC architecture.
Ender E Bilir - One of the best experts on this subject based on the ideXlab platform.
-
Multicast snooping a new coherence method using a Multicast Address network
International Symposium on Computer Architecture, 1999Co-Authors: Ender E Bilir, Ross M Dickson, Manoj Plakal, Daniel J Sorin, Mark D Hill, David A WoodAbstract:This paper proposes a new coherence method called "Multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a Multicast "mask." Transactions are delivered with an ordered Multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol, while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit Multicasts to an average of 2-6 destinations (ll 32) and we can deliver 2-5 Multicasts per network cycle (gg broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that Multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories).
-
ISCA - Multicast snooping: a new coherence method using a Multicast Address network
1999Co-Authors: Ender E Bilir, Ross M Dickson, Manoj Plakal, Daniel J Sorin, Mark D Hill, David A WoodAbstract:This paper proposes a new coherence method called "Multicast snooping" that dynamically adapts between broadcast snooping and a directory protocol. Multicast snooping is unique because processors predict which caches should snoop each coherence transaction by specifying a Multicast "mask." Transactions are delivered with an ordered Multicast network, such as an Isotach network, which eliminates the need for acknowledgment messages. Processors handle transactions as they would with a snooping protocol, while a simplified directory operates in parallel to check masks and gracefully handle incorrect ones (e.g., previous owner missing). Preliminary performance numbers with mostly SPLASH-2 benchmarks running on 32 processors show that we can limit Multicasts to an average of 2-6 destinations (ll 32) and we can deliver 2-5 Multicasts per network cycle (gg broadcast snooping's 1 per cycle). While these results do not include timing, they do provide encouragement that Multicast snooping can obtain data directly (like broadcast snooping) but apply to larger systems (like directories).