Average Hop Count - Explore the Science & Experts | ideXlab

Scan Science and Technology

Contact Leading Edge Experts & Companies

Average Hop Count

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

Uri Pincas – One of the best experts on this subject based on the ideXlab platform.

  • Virtual path layouts optimizing total Hop Count on ATM tree networks
    Journal of Discrete Algorithms, 2005
    Co-Authors: David Peleg, Uri Pincas

    Abstract:

    Abstract This paper presents some algorithmic results concerning virtual path layouts for the one-to-many communication problem in ATM tree networks. The ATM network model is based on covering the network with a layout of virtual paths, under some constraints on the allowed load, namely, the number of paths that can share an edge. The quality measure used is the Hop Count, namely, the number of edges traversed between two vertices that need to communicate. Whereas most former results concerned the maximum Hop Count of the virtual path layout, our interest here is in measuring its total Hop Count, or alternatively its Average Hop Count. The paper presents a dynamic programming algorithm for planning ATM network layouts with minimal total Hop Count for one-to-many requirements under load constraints over the class of tree networks.

  • the Average Hop Count measure for virtual path layouts
    International Symposium on Distributed Computing, 2001
    Co-Authors: David Peleg, Uri Pincas

    Abstract:

    This paper studies the Average Hop Count measure for virtual path layouts of ATM and optical networks. Routing in the ATM and optical network models is based on covering the network with simple virtual paths, under some constraints on the allowed load (i.e., the number of paths that can share an edge). The Hop Count is the number of edges along the virtual path.Two basic results are established concerning the Average Hop Count parameter. The first concerns comparing the maximum and Average Hop Count measures assuming uniform all-to-all communication requirements. We develop a rather general connection between the two measures for virtual path layouts with bounded maximum load. This connection allows us to extend known lower bounds on the maximum Hop Count into ones on the Average Hop Count for network families satisfying certain conditions, termed non-condensingly contractable (NCC) graph families. Using this characterization, we establish tight lower bounds on the Average Hop Count of virtual path layouts with bounded maximum load for paths, cycles, and trees.Our second result is an algorithm for designing a virtual path layout of minimum Average Hop Count for a given tree network with general (weighted) one-to-all requirements.

  • DISC – The Average Hop Count Measure for Virtual Path Layouts
    Lecture Notes in Computer Science, 2001
    Co-Authors: David Peleg, Uri Pincas

    Abstract:

    This paper studies the Average Hop Count measure for virtual path layouts of ATM and optical networks. Routing in the ATM and optical network models is based on covering the network with simple virtual paths, under some constraints on the allowed load (i.e., the number of paths that can share an edge). The Hop Count is the number of edges along the virtual path.Two basic results are established concerning the Average Hop Count parameter. The first concerns comparing the maximum and Average Hop Count measures assuming uniform all-to-all communication requirements. We develop a rather general connection between the two measures for virtual path layouts with bounded maximum load. This connection allows us to extend known lower bounds on the maximum Hop Count into ones on the Average Hop Count for network families satisfying certain conditions, termed non-condensingly contractable (NCC) graph families. Using this characterization, we establish tight lower bounds on the Average Hop Count of virtual path layouts with bounded maximum load for paths, cycles, and trees.Our second result is an algorithm for designing a virtual path layout of minimum Average Hop Count for a given tree network with general (weighted) one-to-all requirements.

Pinhan Ho – One of the best experts on this subject based on the ideXlab platform.

  • virtual topology design for minimizing network diameter and Average Hop Count in wdm networks
    IEEE\ OSA Journal of Optical Communications and Networking, 2010
    Co-Authors: Bin Wu, Kwan L Yeung, Pinhan Ho

    Abstract:

    We design virtual topologies in wavelength division multiplexing (WDM) networks to minimize the network diameter and Average Hop Count, where network diameter refers to the number of Hops of the longest shortest path and Average Hop Count is the Average number of Hops among the shortest paths of all node pairs. Such objectives are important to WDM networks, especially to those with statistical multiplexing mechanisms such as optical burst switching (OBS) and optical packet switching (OPS). By minimizing the network diameter and Average Hop Count, optical packets or bursts will experience less contention loss and smaller delay due to a reduced number of intermediate nodes en route. In this paper, we first formulate an integer linear program (ILP) for optimal design of virtual topologies with minimized network diameter and Average Hop Count. Then, a novel heuristic least weight minimum diameter (LWMD) is proposed to find good solutions efficiently. Based on the virtual topology obtained, we further design two traffic accommodation schemes to provision wavelengths under a given traffic matrix, with guaranteed network diameter and minimized network resource consumption.

Bin Wu – One of the best experts on this subject based on the ideXlab platform.

  • virtual topology design for minimizing network diameter and Average Hop Count in wdm networks
    IEEE\ OSA Journal of Optical Communications and Networking, 2010
    Co-Authors: Bin Wu, Kwan L Yeung, Pinhan Ho

    Abstract:

    We design virtual topologies in wavelength division multiplexing (WDM) networks to minimize the network diameter and Average Hop Count, where network diameter refers to the number of Hops of the longest shortest path and Average Hop Count is the Average number of Hops among the shortest paths of all node pairs. Such objectives are important to WDM networks, especially to those with statistical multiplexing mechanisms such as optical burst switching (OBS) and optical packet switching (OPS). By minimizing the network diameter and Average Hop Count, optical packets or bursts will experience less contention loss and smaller delay due to a reduced number of intermediate nodes en route. In this paper, we first formulate an integer linear program (ILP) for optimal design of virtual topologies with minimized network diameter and Average Hop Count. Then, a novel heuristic least weight minimum diameter (LWMD) is proposed to find good solutions efficiently. Based on the virtual topology obtained, we further design two traffic accommodation schemes to provision wavelengths under a given traffic matrix, with guaranteed network diameter and minimized network resource consumption.

  • ICC – Virtual Topology Design for OBS Optical Networks
    2007 IEEE International Conference on Communications, 2007
    Co-Authors: Bin Wu, Kwan L Yeung

    Abstract:

    Burst loss and delay are two main issues in optical burst switching (OBS) networks. In OBS, if the HopCount between the source-destination node pair can be reduced, both the control packet and the corresponding data burst will suffer less risk of contention, and the delay caused by offset time will be reduced as well. Therefore, it is meaningful to overlay OBS upon a virtual topology with reduced network diameter and Average HopCount. In this paper, a novel algorithm LWMD (Least Weight Minimum Diameter) is proposed to construct virtual topology for this goal. Based on the virtual topology obtained, two traffic accommodation schemes are also designed to provision wavelengths for a given traffic matrix. This provides a comprehensive solution to improve the performance of OBS networks.