The Experts below are selected from a list of 4083 Experts worldwide ranked by ideXlab platform
Richard E. Newman - One of the best experts on this subject based on the ideXlab platform.
-
A Distributed Approach to Multicast Session Discovery: mDNS - A Globally Scalable Multicast Session Directory Architecture
2011Co-Authors: Richard E. Newman, Piyush HarshAbstract:This dissertation addresses the issue of Multicast Session discovery by an end user. IP Multicast has tremendous network bandwidth utilization benefits over conventional data transmission strategies. Use of Multicast could prove cost effective for many Content Distribution Networks (CDN). From an end user perspective, accessing a live stream using Multicast will result in better video reception quality compared to the unicast transmission. This being imposed largely due to limited line bandwidth being shared among several competing data streams. Still the deployment is very sparse in the Internet. One of the reasons is less user demand due to lower usability compared to IP unicast. The supporting network infrastructure that was deployed after standardization of TCP protocol helped tremendously in improving the usability of IP unicast. The Domain Name Service (DNS) infrastructure allowed users to access target hosts using a Fully Qualified Domain Name (FQDN) string against using the dotted decimal IP addresses [1]. Since the unicast IP addresses were allotted in a regulated manner and because of the longevity of assignments, it became easier to search and locate resources on the Internet. Lack of such infrastructure support has deprived Multicast its usability from an end user perspective. More importantly, shared nature of Multicast addresses and the short life of address use and frequent reuse from the common pool makes it difficult to search and discover content by the end user. This dissertation provides a distributed hierarchical architecture that efficiently addresses some of the usability issues raised above. The tree hierarchy closely co-located with the DNS infrastructure allows the presented scheme to assign Universal Resource Identifiers (URIs) for Multicast streams that an end user can bookmark. The proposed scheme automatically re-maps the correct Session parameters with the URIs in case they change in future. The Distributed Hash Table (DHT) approach for search and discovery of Multicast Sessions presented in this dissertation uses a tree hierarchy which is more suitable for the task at hand. Many live Multicast streams are not replicated, so there is a need to locate the source of the data and therefore the search scheme required is somewhat traditional in nature. The relative instability of many Multicast streams and associated Session parameters makes many traditional P2P DHT schemes unsuitable for the problems addressed in this work. Simulation results and analytical comparison of the proposed scheme with existing approaches are presented towards the end of this dissertation. A detailed discussion of why several of the existing DHT schemes for keyword search and Session Announcement Protocol (SAP) / Session Discovery Protocol (SDP) based Multicast Session discovery schemes are unsuitable for the identified problem is presented as well.
-
mode independent Session directory service architecture a unified approach for asm and ssm Multicast networks
ACM Symposium on Applied Computing, 2010Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:In this paper we describe architectural changes incorporated into DNS aware Multicast Session Directory (mDNS) that enable it to co-exist in both Any Source Multicast (ASM) and Source Specific Multicast (SSM) environments. mDNS is a distributed, global, scalable and hierarchical approach that allows Multicast Sessions to be searched based on multiple parameters including keywords, Session-type, geo-locality, etc. mDNS design being tightly coupled with existing Domain Name Service (DNS) enables Sessions to be assigned a Uniform Resource Locator (URL) that can be book-marked for future access.We also describe the caching strategy added to mDNS and present arguments on its possible benefits. Afterwards, we will discuss the slight search strategy alteration required by caching and its security implications. This paper also describes our simulation design. We describe how we automated our experiments. The integration of fully implemented mDNS software and our "simulated" network hierarchy will be explained. We provide simulation results and explain their significance with respect to network topography.
-
using geo spatial Session tagging for smart Multicast Session discovery
ACM Symposium on Applied Computing, 2009Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:IP Multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP unicast, Multicast has not seen widespread deployment over modern networks. Network complexity and Session discovery issues have plagued IP Multicast since its inception. The Internet research community is in general agreement to move over to SSM (Source Specific Multicast).With IGMP v 3 (Internet Group Management Protocol) and SSM, the source discovery burden will rest with the end user. Channel discovery is one of the few stumbling blocks remaining to be solved for successful and widespread deployment of Multicast. In an earlier work a DNS (Domain Name System) aware Multicast Session discovery architecture, mDNS, has been proposed which is distributed, hierarchical and globally scalable.This paper proposes to leverage the mDNS architecture by enabling Multicast Sessions to be tagged using geographical and spatial information based on the channel contents or service provider location. It further proposes automatic geo-coding of Session registration information as the content provider registers Session information with mDNS. It also provides necessary design changes and gives data models and data structures to support seamless location sensitive Session retrieval as part of search query results to be furnished to the end user. The paper includes envisaged scenarios in which geo-tagging would enhance end user experience and would enable smarter query result generation.
-
efficient distributed search for Multicast Session keywords
International Conference on Internet Computing, 2009Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:mDNS is a proposed DNS-aware, hierarchical, and scalable Multicast Session directory architecture that enables Multicast Session registration and makes them discoverable in real time. It supports domain-specific as well as global searches for candidate Sessions. This paper improves mDNS global search algorithm and addresses various security and scalability concerns that remained in mDNS. We propose distributing the overall keyword space among designated MSD servers using hash values. In contrast to other P2P keyword search approaches, we propose IP style prefix routing on the keyword hashes to locate the appropriate MSD server in order to register or retrieve any globally-scoped Multicast Session. This supports efficient and fast distributed keyword search.
-
mdns a proposal for hierarchical Multicast Session directory architecture
International Conference on Internet Computing, 2008Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:Bandwidth in the Internet is constantly increasing. The last mile problem of the Internet has almost been solved. Multimedia has emerged as the favorite mode of information dispersal on the net. Multicast is increasingly being seen as the vehicle of choice for multimedia streams. What has been the one true stumbling roadblock in widespread deployment is the lack of DNS like structure for Multicast Session discovery. In this paper we look into some of the existing techniques that tries to address this issue, find out benefits and drawbacks of such schemes. We will propose our hierarchical and globally scalable Sessions directory architecture. This will be followed by analysis of benefits and drawbacks in our scheme and why our scheme might be generally more suitable for global deployment which may allow end users to enjoy the true power and efficiency of IP Multicast.
Piyush Harsh - One of the best experts on this subject based on the ideXlab platform.
-
Recovering from mDNS domain failures
2011Co-Authors: Piyush Harsh, Richard NewmanAbstract:Target Conference: ICOMP Abstract — ‘mDNS ’- a hierarchical Multicast Session directory service architecture, which has been recently submitted to IETF editorial board for publication under Best Current Practice (BCP) track, allows administrative domains to join the global hierarchy incrementally. The global structure dynamically adapts to the changing topology. This paper describes the various failure scenarios in the proposed IETF document and especially the scenario where a participating domain goes down completely. It describes how such a scenario could effect end users ’ experience and how the system can temporarily recover from such failures until the erring domain can be revived
-
A Distributed Approach to Multicast Session Discovery: mDNS - A Globally Scalable Multicast Session Directory Architecture
2011Co-Authors: Richard E. Newman, Piyush HarshAbstract:This dissertation addresses the issue of Multicast Session discovery by an end user. IP Multicast has tremendous network bandwidth utilization benefits over conventional data transmission strategies. Use of Multicast could prove cost effective for many Content Distribution Networks (CDN). From an end user perspective, accessing a live stream using Multicast will result in better video reception quality compared to the unicast transmission. This being imposed largely due to limited line bandwidth being shared among several competing data streams. Still the deployment is very sparse in the Internet. One of the reasons is less user demand due to lower usability compared to IP unicast. The supporting network infrastructure that was deployed after standardization of TCP protocol helped tremendously in improving the usability of IP unicast. The Domain Name Service (DNS) infrastructure allowed users to access target hosts using a Fully Qualified Domain Name (FQDN) string against using the dotted decimal IP addresses [1]. Since the unicast IP addresses were allotted in a regulated manner and because of the longevity of assignments, it became easier to search and locate resources on the Internet. Lack of such infrastructure support has deprived Multicast its usability from an end user perspective. More importantly, shared nature of Multicast addresses and the short life of address use and frequent reuse from the common pool makes it difficult to search and discover content by the end user. This dissertation provides a distributed hierarchical architecture that efficiently addresses some of the usability issues raised above. The tree hierarchy closely co-located with the DNS infrastructure allows the presented scheme to assign Universal Resource Identifiers (URIs) for Multicast streams that an end user can bookmark. The proposed scheme automatically re-maps the correct Session parameters with the URIs in case they change in future. The Distributed Hash Table (DHT) approach for search and discovery of Multicast Sessions presented in this dissertation uses a tree hierarchy which is more suitable for the task at hand. Many live Multicast streams are not replicated, so there is a need to locate the source of the data and therefore the search scheme required is somewhat traditional in nature. The relative instability of many Multicast streams and associated Session parameters makes many traditional P2P DHT schemes unsuitable for the problems addressed in this work. Simulation results and analytical comparison of the proposed scheme with existing approaches are presented towards the end of this dissertation. A detailed discussion of why several of the existing DHT schemes for keyword search and Session Announcement Protocol (SAP) / Session Discovery Protocol (SDP) based Multicast Session discovery schemes are unsuitable for the identified problem is presented as well.
-
mode independent Session directory service architecture a unified approach for asm and ssm Multicast networks
ACM Symposium on Applied Computing, 2010Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:In this paper we describe architectural changes incorporated into DNS aware Multicast Session Directory (mDNS) that enable it to co-exist in both Any Source Multicast (ASM) and Source Specific Multicast (SSM) environments. mDNS is a distributed, global, scalable and hierarchical approach that allows Multicast Sessions to be searched based on multiple parameters including keywords, Session-type, geo-locality, etc. mDNS design being tightly coupled with existing Domain Name Service (DNS) enables Sessions to be assigned a Uniform Resource Locator (URL) that can be book-marked for future access.We also describe the caching strategy added to mDNS and present arguments on its possible benefits. Afterwards, we will discuss the slight search strategy alteration required by caching and its security implications. This paper also describes our simulation design. We describe how we automated our experiments. The integration of fully implemented mDNS software and our "simulated" network hierarchy will be explained. We provide simulation results and explain their significance with respect to network topography.
-
using geo spatial Session tagging for smart Multicast Session discovery
ACM Symposium on Applied Computing, 2009Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:IP Multicast is increasingly seen as efficient mode of live content distribution in the Internet to significantly large subscriber bases. Despite its numerous benefits over IP unicast, Multicast has not seen widespread deployment over modern networks. Network complexity and Session discovery issues have plagued IP Multicast since its inception. The Internet research community is in general agreement to move over to SSM (Source Specific Multicast).With IGMP v 3 (Internet Group Management Protocol) and SSM, the source discovery burden will rest with the end user. Channel discovery is one of the few stumbling blocks remaining to be solved for successful and widespread deployment of Multicast. In an earlier work a DNS (Domain Name System) aware Multicast Session discovery architecture, mDNS, has been proposed which is distributed, hierarchical and globally scalable.This paper proposes to leverage the mDNS architecture by enabling Multicast Sessions to be tagged using geographical and spatial information based on the channel contents or service provider location. It further proposes automatic geo-coding of Session registration information as the content provider registers Session information with mDNS. It also provides necessary design changes and gives data models and data structures to support seamless location sensitive Session retrieval as part of search query results to be furnished to the end user. The paper includes envisaged scenarios in which geo-tagging would enhance end user experience and would enable smarter query result generation.
-
efficient distributed search for Multicast Session keywords
International Conference on Internet Computing, 2009Co-Authors: Piyush Harsh, Richard E. NewmanAbstract:mDNS is a proposed DNS-aware, hierarchical, and scalable Multicast Session directory architecture that enables Multicast Session registration and makes them discoverable in real time. It supports domain-specific as well as global searches for candidate Sessions. This paper improves mDNS global search algorithm and addresses various security and scalability concerns that remained in mDNS. We propose distributing the overall keyword space among designated MSD servers using hash values. In contrast to other P2P keyword search approaches, we propose IP style prefix routing on the keyword hashes to locate the appropriate MSD server in order to register or retrieve any globally-scoped Multicast Session. This supports efficient and fast distributed keyword search.
Chunming Qiao - One of the best experts on this subject based on the ideXlab platform.
-
fen zhou miklos molnar bernard cousin chunming qiao cost bounds and approximation ratios of Multicast light trees in wdm networks april 2011 digital object identifier
2011Co-Authors: Fen Zhou, Miklos Molnar, Bernard Cousin, Chunming QiaoAbstract:The construction of light-trees is one of the principal subproblems for all-optical Multicast routing (AOMR) in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a Multicast Session. However, the computation of the cost-optimal Multicast light-trees is NP-hard. In this paper, first we study the cost bounds of the light- trees built for a Multicast Session in unweighted WDM networks. Then, partially based on this result, the approximation ratios of some classical Multicast light-tree computation algorithms, i.e., Reroute-to-Source (R2S) and Member-Only (MO) algorithms are derived in both unweighted and non-equally weighted WDM networks. Moreover, integer linear programming (ILP) formulations are introduced and carried out to search the optimal light-trees for Multicast routing. The cost bounds and approximation ratios of R2S and MO algorithms in some candidate WDM backbone networks are examined through simulations.
-
constrained Multicast routing in wdm networks with sparse light splitting
Journal of Lightwave Technology, 2000Co-Authors: Xijun Zhang, J Wei, Chunming QiaoAbstract: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, 2000Co-Authors: Xijun Zhang, J Wei, Chunming QiaoAbstract: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.
Ness B Shroff - One of the best experts on this subject based on the ideXlab platform.
-
pairwise interSession network coding on directed networks
IEEE Transactions on Information Theory, 2010Co-Authors: Chih-chun Wang, Ness B ShroffAbstract:When there exists only a single Multicast Session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow theorem. For the case of more than one coexisting Sessions, network coding also demonstrates throughput improvement over noncoded solutions. This paper proposes pairwise interSession network coding, which allows for arbitrary directed networks but restricts the coding operations to being between two symbols (for acyclic networks) or between two strings of symbols (for cyclic networks). A graph-theoretic characterization of pairwise interSession network coding is proven based on paths with controlled edge-overlap. This new characterization generalizes the edge-disjoint path characterization of noncoded network communication and includes the well-studied butterfly graph as a special case. Based on this new characterization, various aspects of pairwise interSession network coding are studied, including the sufficiency of linear codes, the complexity of identifying coding opportunities, its topological analysis, and bandwidth- and coding-efficiency.
Li Chunlin - One of the best experts on this subject based on the ideXlab platform.
-
a qos Multicast routing protocol for dynamic group topology
Information Sciences, 2005Co-Authors: Li Layuan, Li ChunlinAbstract:Multicast routing is establishing a tree which is rooted from the source node and contains all the Multicast destinations. A Multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay-jitter, packet-loss and bandwidth should satisfy the pre-specified bounds. This paper discusses the Multicast routing problem with multiple QoS constraints, which may deal with the delay, delay-jitter, bandwidth and packet-loss metrics, and describes a network model for researching the routing problem. It presents a QoS Multicast routing protocol with dynamic group topology (QMRPD). The QMRPD attempts to significantly reduce the overhead of constructing a Multicast tree with multiple QoS constraints. In MPRMQ, a Multicast group member can join or leave a Multicast Session dynamically, which should not disrupt the Multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost's (or lower cost) requirements. In this paper, the proof of correctness and complexity analysis of the QMRPD are also given. Simulation results show that QMRPD is an available approach to Multicast routing decision with dynamic group topology.
-
a distributed qos aware Multicast routing protocol
Acta Informatica, 2003Co-Authors: Li Layuan, Li ChunlinAbstract:This paper discusses the Multicast routing problem with QoS constraints, and describes a network model that is suitable to research such routing problem. The paper mainly presents a distributed QoS-aware Multicast routing protocol (QMRP). The QMRP can operate on top of the unicast routing protocol. It only requires the local state information of the link (or the node), but does not require any global network state to be maintained. The QMRP can significantly reduce the overhead for constructing a Multicast tree with QoS constraints. In QMRP, a Multicast group member can join or leave the Multicast Session dynamically, which can support dynamic membership. The protocol can search multiple feasible tree branches, and select the optimal or near-optimal branch for connecting the new receiver to the Multicast tree if it exists. In this paper, the proof of correctness and complexity analysis of the QMRP are given, and the performance measures of the protocol are evaluated using simulation. The study shows that QMRP provides an available approach to Multicast routing with QoS constraints and dynamic membership support.
-
a qos Multicast routing protocol for dynamic group topology
European Conference on Parallel Processing, 2003Co-Authors: Li Layuan, Li ChunlinAbstract:This paper discusses the Multicast routing problem with multiple QoS constraints, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. It presents a Multicast routing protocol with multiple QoS constraints (MRPMQ). The MRPMQ attempts to significantly reduce the overhead of constructing a Multicast tree with multiple QoS constraints. In MPRMQ, a Multicast group member can join or leave a Multicast Session dynamically, which should not disrupt the Multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost (or lower cost) requirements. In this paper, the proof of correctness and a complexity analysis of the MRPMQ are also given. Simulation results show that MRPMQ is a feasible approach to Multicast routing with multiple QoS constraints.