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

Shuo Guo - One of the best experts on this subject based on the ideXlab platform.

  • trajectory based statistical forwarding for multihop infrastructure to vehicle data delivery
    IEEE Transactions on Mobile Computing, 2012
    Co-Authors: Jaehoon Jeong, Shuo Guo
    Abstract:

    This paper proposes Trajectory-based Statistical Forwarding (TSF) scheme, tailored for the multihop data delivery from infrastructure nodes (e.g., Internet access Points) to moving vehicles in vehicular ad hoc networks. To our knowledge, this paper presents the first attempt to investigate how to effectively utilize the packet destination vehicle's trajectory for such an infrastructure-to-vehicle data delivery. This data delivery is performed through the computation of a target Point based on the destination vehicle's trajectory that is an optimal Rendezvous Point of the packet and the destination vehicle. TSF forwards packets over multihop to a selected target Point where the vehicle is expected to pass by. Such a target Point is selected optimally to minimize the packet delivery delay while satisfying the required packet delivery probability. The optimality is achieved analytically by utilizing the packet's delivery delay distribution and the destination vehicle's travel delay distribution. Through theoretical analysis and extensive simulation, it is shown that our design provides an efficient data forwarding under a variety of vehicular traffic conditions.

  • tsf trajectory based statistical forwarding for infrastructure to vehicle data delivery in vehicular networks
    International Conference on Distributed Computing Systems, 2010
    Co-Authors: Jaehoon Jeong, Shuo Guo
    Abstract:

    This paper proposes a data forwarding scheme called Trajectory-based Statistical Forwarding (TSF), tailored for the data delivery from infrastructure nodes (e.g., Internet access Points) to moving vehicles in vehicular networks. To our knowledge, this paper presents the first attempt to investigate how to effectively utilize the packet destination vehicle’s trajectory for such an infrastructure-to-vehicle data delivery. This data delivery is performed through the computation of a target Point based on the destination vehicle’s trajectory that is an optimal Rendezvous Point of the packet and the destination vehicle. TSF forwards packets over multi-hop to a selected target Point where the vehicle is expected to pass by. Such a target Point is selected optimally to minimize the packet delivery delay while satisfying the required packet delivery probability. The optimality is achieved analytically by utilizing the packet’s delivery delay distribution and the destination vehicle’s travel delay distribution. Through theoretical analysis and extensive simulation, it is shown that our design provides an efficient data forwarding under a variety of vehicular traffic conditions.

Jaehoon Jeong - One of the best experts on this subject based on the ideXlab platform.

  • trajectory based statistical forwarding for multihop infrastructure to vehicle data delivery
    IEEE Transactions on Mobile Computing, 2012
    Co-Authors: Jaehoon Jeong, Shuo Guo
    Abstract:

    This paper proposes Trajectory-based Statistical Forwarding (TSF) scheme, tailored for the multihop data delivery from infrastructure nodes (e.g., Internet access Points) to moving vehicles in vehicular ad hoc networks. To our knowledge, this paper presents the first attempt to investigate how to effectively utilize the packet destination vehicle's trajectory for such an infrastructure-to-vehicle data delivery. This data delivery is performed through the computation of a target Point based on the destination vehicle's trajectory that is an optimal Rendezvous Point of the packet and the destination vehicle. TSF forwards packets over multihop to a selected target Point where the vehicle is expected to pass by. Such a target Point is selected optimally to minimize the packet delivery delay while satisfying the required packet delivery probability. The optimality is achieved analytically by utilizing the packet's delivery delay distribution and the destination vehicle's travel delay distribution. Through theoretical analysis and extensive simulation, it is shown that our design provides an efficient data forwarding under a variety of vehicular traffic conditions.

  • tsf trajectory based statistical forwarding for infrastructure to vehicle data delivery in vehicular networks
    International Conference on Distributed Computing Systems, 2010
    Co-Authors: Jaehoon Jeong, Shuo Guo
    Abstract:

    This paper proposes a data forwarding scheme called Trajectory-based Statistical Forwarding (TSF), tailored for the data delivery from infrastructure nodes (e.g., Internet access Points) to moving vehicles in vehicular networks. To our knowledge, this paper presents the first attempt to investigate how to effectively utilize the packet destination vehicle’s trajectory for such an infrastructure-to-vehicle data delivery. This data delivery is performed through the computation of a target Point based on the destination vehicle’s trajectory that is an optimal Rendezvous Point of the packet and the destination vehicle. TSF forwards packets over multi-hop to a selected target Point where the vehicle is expected to pass by. Such a target Point is selected optimally to minimize the packet delivery delay while satisfying the required packet delivery probability. The optimality is achieved analytically by utilizing the packet’s delivery delay distribution and the destination vehicle’s travel delay distribution. Through theoretical analysis and extensive simulation, it is shown that our design provides an efficient data forwarding under a variety of vehicular traffic conditions.

L. Wei - One of the best experts on this subject based on the ideXlab platform.

  • Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
    1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and optionally creates shortest-path trees per source. This document obsoletes RFC 2362, an Experimental version of PIM-SM. [STANDARDS-TRACK]

  • protocol independent multicast sparse mode pim sm protocol specification
    RFC2117, 1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and it optionally creates shortest-path trees per source. This document obsoletes RFC 4601 by replacing it, addresses the errata filed against it, removes the optional (*,*,RP), PIM Multicast Border Router features and authentication using IPsec that lack sufficient deployment experience (see Appendix A), and moves the PIM specification to Internet Standard.

Deborah Estrin - One of the best experts on this subject based on the ideXlab platform.

  • a dynamic bootstrap mechanism for Rendezvous based multicast routing
    In: (pp. pp. 1090-1098). IEEE (1999), 1999
    Co-Authors: Deborah Estrin, Ahmed Helmy, Mark Handley, Polly Huang, David G. Thaler
    Abstract:

    Current multicast routing protocols can be classified into three types according to how the multicast tree is established: broadcast and prune (e.g., DVMRP, PIM-DM), membership advertisement (e.g., MO-SPF), and Rendezvous-based (e.g., CBT, PIM-SM). Rendezvous-based protocols associate with each logical multicast group address, a physical unicast address, referred to as the 'core' or 'Rendezvous Point' (RP). Members first join a multicast tree rooted at this Rendezvous Point in order to receive data packets sent to the group. Rendezvous mechanisms are well suited to large wide-area networks because they distribute group-specific data and membership information only to those routers that are on the multicast distribution tree. However, Rendezvous protocols require a bootstrap mechanism to map each logical multicast address to its current physical Rendezvous Point address. The bootstrap mechanism must adapt to network and router failures but should minimize unnecessary changes in the group-to-RP mapping. In addition, the bootstrap mechanism should be transparent to the hosts. This paper describes and analyzes the bootstrap mechanism developed for PIM-SM. The mechanism employs an algorithmic mapping of multicast group to Rendezvous Point address, based on a set of available RPs distributed throughout a multicast domain. The primary evaluation measures are convergence time, message distribution overhead, balanced assignment of groups to RPs, and host impact. The mechanism as a whole, and the design lessons in particular, are applicable to other Rendezvous-based multicast routing protocols as well.

  • Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
    1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and optionally creates shortest-path trees per source. This document obsoletes RFC 2362, an Experimental version of PIM-SM. [STANDARDS-TRACK]

  • protocol independent multicast sparse mode pim sm protocol specification
    RFC2117, 1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and it optionally creates shortest-path trees per source. This document obsoletes RFC 4601 by replacing it, addresses the errata filed against it, removes the optional (*,*,RP), PIM Multicast Border Router features and authentication using IPsec that lack sufficient deployment experience (see Appendix A), and moves the PIM specification to Internet Standard.

Mark Handley - One of the best experts on this subject based on the ideXlab platform.

  • bidirectional protocol independent multicast bidir pim
    RFC, 2007
    Co-Authors: Mark Handley, Lorenzo Vicisano, Isidor Kouvelas, Tony Speakman
    Abstract:

    This document discusses Bi-directional PIM, a variant of PIM Sparse- Mode [4] that builds bi-directional shared trees connecting multicast sources and receivers. Bi-directional trees are built using a fail- safe Designated Forwarder (DF) election mechanism operating on each link of a multicast topology. With the assistance of the DF, multicast data is natively forwarded from sources to the Rendezvous-Point and hence along the shared tree to receivers without requiring source- specific state. The DF election takes place at RP discovery time and provides the route to the RP thus eliminating the requirement for data-driven protocol events.

  • a dynamic bootstrap mechanism for Rendezvous based multicast routing
    In: (pp. pp. 1090-1098). IEEE (1999), 1999
    Co-Authors: Deborah Estrin, Ahmed Helmy, Mark Handley, Polly Huang, David G. Thaler
    Abstract:

    Current multicast routing protocols can be classified into three types according to how the multicast tree is established: broadcast and prune (e.g., DVMRP, PIM-DM), membership advertisement (e.g., MO-SPF), and Rendezvous-based (e.g., CBT, PIM-SM). Rendezvous-based protocols associate with each logical multicast group address, a physical unicast address, referred to as the 'core' or 'Rendezvous Point' (RP). Members first join a multicast tree rooted at this Rendezvous Point in order to receive data packets sent to the group. Rendezvous mechanisms are well suited to large wide-area networks because they distribute group-specific data and membership information only to those routers that are on the multicast distribution tree. However, Rendezvous protocols require a bootstrap mechanism to map each logical multicast address to its current physical Rendezvous Point address. The bootstrap mechanism must adapt to network and router failures but should minimize unnecessary changes in the group-to-RP mapping. In addition, the bootstrap mechanism should be transparent to the hosts. This paper describes and analyzes the bootstrap mechanism developed for PIM-SM. The mechanism employs an algorithmic mapping of multicast group to Rendezvous Point address, based on a set of available RPs distributed throughout a multicast domain. The primary evaluation measures are convergence time, message distribution overhead, balanced assignment of groups to RPs, and host impact. The mechanism as a whole, and the design lessons in particular, are applicable to other Rendezvous-based multicast routing protocols as well.

  • Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification
    1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and optionally creates shortest-path trees per source. This document obsoletes RFC 2362, an Experimental version of PIM-SM. [STANDARDS-TRACK]

  • protocol independent multicast sparse mode pim sm protocol specification
    RFC2117, 1997
    Co-Authors: Deborah Estrin, David G. Thaler, Dino Farinacci, Ahmed Helmy, S. Deering, Mark Handley, Van Jacobson, C. Liu, Puneet Sharma, L. Wei
    Abstract:

    This document specifies Protocol Independent Multicast - Sparse Mode (PIM-SM). PIM-SM is a multicast routing protocol that can use the underlying unicast routing information base or a separate multicast- capable routing information base. It builds unidirectional shared trees rooted at a Rendezvous Point (RP) per group, and it optionally creates shortest-path trees per source. This document obsoletes RFC 4601 by replacing it, addresses the errata filed against it, removes the optional (*,*,RP), PIM Multicast Border Router features and authentication using IPsec that lack sufficient deployment experience (see Appendix A), and moves the PIM specification to Internet Standard.