The Experts below are selected from a list of 9978 Experts worldwide ranked by ideXlab platform

Andrei Gurtov - One of the best experts on this subject based on the ideXlab platform.

  • isBF: Scalable in-packet bloom filter based Multicast
    Computer Communications, 2015
    Co-Authors: Ilya Nikolaevskiy, Valentin Polishchuk, Tatiana Polishchuk, Andrey Lukyanenko, Andrei Gurtov
    Abstract:

    Bloom filter (BF) based forwarding was proposed recently in several protocol alternatives to IP Multicast. Some of these protocols avoid the state in intermediate routers and leave the burden of scalability management to the Multicast Source and end-hosts. Still, the existing BF-based protocols have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we address the scalability limitations of the BF-based forwarding protocols by partitioning end-hosts into clusters. We propose several algorithms to do the partitioning so as to decrease the overall traffic in the network. We evaluate our algorithms in a real Internet topology, demonstrating the ability of the proposed design to save up to 70% of traffic volume in the large-scale topology for big groups of subscribers, and up to 30% for small groups.

  • isbf scalable in packet bloom filter based Multicast
    ACM Symposium on Applied Computing, 2013
    Co-Authors: Ilya Nikolaevskiy, Valentin Polishchuk, Tatiana Polishchuk, Andrey Lukyanenko, Andrei Gurtov
    Abstract:

    Bloom filter based forwarding was proposed recently in several protocol alternatives to IP Multicast. Even though some of these protocols avoid the state in intermediate routers, they still have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we propose an architecture based on in-packet Bloom filter forwarding, in which the burden of scalability management is left to the Multicast Source and end-hosts. We present several algorithms to improve the scalability of Multicast transmission and evaluate them in a real Internet topology. Our evaluation confirms the ability of the proposed stateless design to save up to 70% of traffic volume in the large scale topology for big groups of subscribers, and up to 30% for small groups.

Chunming Qiao - One of the best experts on this subject based on the ideXlab platform.

  • constrained Multicast routing in wdm networks with sparse light splitting
    Journal of Lightwave Technology, 2000
    Co-Authors: Xijun Zhang, J Wei, Chunming Qiao
    Abstract:

    As wavelength division multiplexing (WDM) technology matures and Multicast applications become increasingly popular, supporting Multicast at the WDM layer becomes an important and yet challenging topic. In this paper, we study constrained Multicast routing in WDM networks with sparse light splitting, i.e., where some switches are incapable of splitting light (of copying data in the optical domain) due to evolutional and/or economical reasons. Specifically, we propose four WDM Multicast routing algorithms, namely, re-route-to-Source, re-route-to-any, member-first, and member-only. Given the network topology, Multicast membership information, and light splitting capability of the switches, these algorithms construct a Source-based Multicast "light-forest" (consisting one or more Multicast trees) for each Multicast session. While the first two algorithms can build on a Multicast tree constructed by IP (which does not take into consideration the splitting capability of the WDM switches), the last two algorithms attempt to address the joint problem of optimal Multicast routing and sparse splitting in WDM networks. The performance of these algorithms are compared in terms of the average number of wavelengths used per forest (or Multicast session), average number of branches involved (bandwidth) per forest as well as average number of hops encountered (delay) from a Multicast Source to a Multicast member. The results obtained from this research should present new and exciting opportunities for further theoretical as well as experimental work.

  • constrained Multicast routing in wdm networks with sparse light splitting
    International Conference on Computer Communications, 2000
    Co-Authors: Xijun Zhang, J Wei, Chunming Qiao
    Abstract:

    As WDM technology matures and Multicast applications become increasingly popular, supporting Multicast at the WDM layer becomes an important and yet challenging topic. In this paper, we study constrained Multicast routing in WDM networks with sparse light splitting, i.e., where some switches are incapable of splitting light (or copying data in the optical domain). Specifically, we propose four WDM Multicast routing algorithms, namely, Re-route-to Source, Re-route-to-Any, Member-First, and Member-Only. Given the network topology, Multicast membership information, and light splitting capability of the switches, these algorithms construct a Source-based Multicast light-forest (consisting one or more Multicast trees) for each Multicast session. The performance of these algorithms are compared in terms of the average number of wavelengths used per forest (or Multicast session), average number of branches involved (bandwidth) per forest as well as average number of hops encountered (delay) from a Multicast Source to a Multicast member.

Wen-kang Jia - One of the best experts on this subject based on the ideXlab platform.

  • A Scalable Multicast Source Routing Architecture for Data Center Networks
    2016
    Co-Authors: Wen-kang Jia
    Abstract:

    Abstract—This paper introduces a new scalable, efficient and stateless Source routing scheme to ensure that unified unicast and Multicast packets can be delivered in the Data Center Networks (DCNs). This scheme, called Code-Oriented eXplicit Multicast (COXcast), is based on unicast and eXplicit Multicast (Xcast). It constructs the unicast path and Multicast tree by encoding the corresponding output port bitmap of each intermediate node. Using a common identifier and a node-specific key, so packets can be self-routed to multiple receivers without requiring header modification. In addition, intermediate switches/routers on the path/tree can be stateless. Compared to traditional Source-based unicasting and explicit-based Multicasting schemes, COXcast has lowered the processing cost, protocol overhead and delivery latency, while simplifying the deployment and management of a large number of medium-scale Multicast groups, especially when applied to large-scale DCNs. Index Terms—Code-Oriented eXplicit Multicast (COXcast), eXplicit Multicast (Xcast), Source routing, Chinese Remainder Theorem (CRT), Data Center Networks (DCNs). I

  • a scalable Multicast Source routing architecture for data center networks
    IEEE Journal on Selected Areas in Communications, 2014
    Co-Authors: Wen-kang Jia
    Abstract:

    This paper introduces a new scalable, efficient and stateless Source routing scheme to ensure that unified unicast and Multicast packets can be delivered in the Data Center Networks (DCNs). This scheme, called Code-Oriented eXplicit Multicast (COXcast), is based on unicast and eXplicit Multicast (Xcast). It constructs the unicast path and Multicast tree by encoding the corresponding output port bitmap of each intermediate node. Using a common identifier and a node-specific key, so packets can be self-routed to multiple receivers without requiring header modification. In addition, intermediate switches/routers on the path/tree can be stateless. Compared to traditional Source-based unicasting and explicit-based Multicasting schemes, COXcast has lowered the processing cost, protocol overhead and delivery latency, while simplifying the deployment and management of a large number of medium-scale Multicast groups, especially when applied to large-scale DCNs.

Ilya Nikolaevskiy - One of the best experts on this subject based on the ideXlab platform.

  • isBF: Scalable in-packet bloom filter based Multicast
    Computer Communications, 2015
    Co-Authors: Ilya Nikolaevskiy, Valentin Polishchuk, Tatiana Polishchuk, Andrey Lukyanenko, Andrei Gurtov
    Abstract:

    Bloom filter (BF) based forwarding was proposed recently in several protocol alternatives to IP Multicast. Some of these protocols avoid the state in intermediate routers and leave the burden of scalability management to the Multicast Source and end-hosts. Still, the existing BF-based protocols have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we address the scalability limitations of the BF-based forwarding protocols by partitioning end-hosts into clusters. We propose several algorithms to do the partitioning so as to decrease the overall traffic in the network. We evaluate our algorithms in a real Internet topology, demonstrating the ability of the proposed design to save up to 70% of traffic volume in the large-scale topology for big groups of subscribers, and up to 30% for small groups.

  • isbf scalable in packet bloom filter based Multicast
    ACM Symposium on Applied Computing, 2013
    Co-Authors: Ilya Nikolaevskiy, Valentin Polishchuk, Tatiana Polishchuk, Andrey Lukyanenko, Andrei Gurtov
    Abstract:

    Bloom filter based forwarding was proposed recently in several protocol alternatives to IP Multicast. Even though some of these protocols avoid the state in intermediate routers, they still have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we propose an architecture based on in-packet Bloom filter forwarding, in which the burden of scalability management is left to the Multicast Source and end-hosts. We present several algorithms to improve the scalability of Multicast transmission and evaluate them in a real Internet topology. Our evaluation confirms the ability of the proposed stateless design to save up to 70% of traffic volume in the large scale topology for big groups of subscribers, and up to 30% for small groups.

Chihchun Wang - One of the best experts on this subject based on the ideXlab platform.

  • pacifier high throughput reliable Multicast without crying babies in wireless mesh networks
    IEEE ACM Transactions on Networking, 2012
    Co-Authors: Dimitrios Koutsonikolas, Chihchun Wang
    Abstract:

    In contrast to unicast routing, high-throughput reliable Multicast routing in wireless mesh networks (WMNs) has received little attention. There are two primary challenges to supporting high-throughput, reliable Multicast in WMNs. The first is no different from unicast: Wireless links are inherently lossy due to varying channel conditions and interference. The second, known as the "crying baby" problem, is unique to Multicast: The Multicast Source may have varying throughput to different Multicast receivers, and hence trying to satisfy the reliability requirement for poorly connected receivers can potentially result in performance degradation for the rest of the receivers. In this paper, we propose Pacifier, a new high-throughput, reliable Multicast protocol for WMNs. Pacifier seamlessly integrates four building blocks--namely, tree-based opportunistic routing, intraflow network coding, Source rate limiting, and round-robin batching--to support high-throughput, reliable Multicast routing in WMNs, while at the same time it effectively addresses the "crying baby" problem. Our experiments on a 22-node IEEE 802.11 WMN testbed show that Pacifier increases the average throughput over a state-of-the-art reliable network coding-based protocol MORE by up to 144%, while at the same time it solves the "crying baby" problem by improving the throughput of well-connected receivers by up to a factor of 14.

  • pacifier high throughput reliable Multicast without crying babies in wireless mesh networks
    International Conference on Computer Communications, 2009
    Co-Authors: Dimitrios Koutsonikolas, Chihchun Wang
    Abstract:

    In contrast to unicast routing, high-throughput reliable Multicast routing in wireless mesh networks (WMNs) has received little attention. There are two primary challenges to supporting high-throughput, reliable Multicast in WMNs. The first is no different from unicast: wireless links are inherently lossy due to varying channel conditions and interference. The second, known as the "crying baby" problem, is unique to Multicast: the Multicast Source may have varying throughput to different Multicast receivers, and hence trying to satisfy the reliability requirement for poorly connected receivers can potentially result in performance degradation for the rest of the receivers. In this paper, we propose Pacifier, a new high-throughput reliable Multicast protocol for WMNs. Pacifier seamlessly integrates four building blocks, namely, tree-based opportunistic routing, intra-flow network coding, Source rate limiting, and round-robin batching, to support high-throughput, reliable Multicast routing in WMNs, while at the same time effectively addresses the "crying baby" problem. Our evaluations show that Pacifier increases the average throughput over a practical, state-of-the-art reliable network coding-based protocol MORE by 171%, while improving the throughput of well-connected receivers by up to a factor of 20.