Quantification and Comparison of Degree Distributions in Complex Networks

The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to compare the degree distribution of two given networks and extract the amount of similarity between the two distributions. In this paper, we propose a novel method for quantification of the degree distributions in complex networks. Based on this quantification method,a new distance function is also proposed for degree distributions, which captures the differences in the overall structure of the two given distributions. The proposed method is able to effectively compare networks even with different scales, and outperforms the state of the art methods considerably, with respect to the accuracy of the distance function

Ricci Curvature of the Internet Topology

Analysis of Internet topologies has shown that the Internet topology has negative curvature, measured by Gromov's "thin triangle condition", which is tightly related to core congestion and route reliability. In this work we analyze the discrete Ricci curvature of the Internet, defined by Ollivier, Lin, etc. Ricci curvature measures whether local distances diverge or converge. It is a more local measure which allows us to understand the distribution of curvatures in the network. We show by various Internet data sets that the distribution of Ricci cuvature is spread out, suggesting the network topology to be non-homogenous. We also show that the Ricci curvature has interesting connections to both local measures such as node degree and clustering coefficient, global measures such as betweenness centrality and network connectivity, as well as auxilary attributes such as geographical distances. These observations add to the richness of geometric structures in complex network theory.Comment: 9 pages, 16 figures. To be appear on INFOCOM 201

Available Bandwidth Estimation Tools Metrics, Approaches and Performance

The estimation of the available bandwidth (av bw) between two end nodes through the Internet, is an area that has motivated researchers around the world in the last twenty years, to have faster and more accurate tools; Due to the utility it has in various network applications; Such as routing management, intrusion detection systems and the performance of transport protocols. Different tools use different estimation techniques but generally only analyze the three most used metrics as av bw, relative error and estimation time. This work expands the information regarding the evaluation literature of the current Available Bandwidth Estimation Tools (ABET’s), where they analyze the estimation techniques, metrics, different generation tools of cross-traf?c and evaluation testbed; Concentrating on the techniques and estimation methodologies used, as well as the challenges faced by open-source tools in high-performance networks of 10Gbps or higher

Available Bandwidth Estimation Tools Metrics, Approaches and Performance

The estimation of the available bandwidth (av_bw) between two end nodes through the Internet, is an area that has motivated researchers around the world in the last twenty years, to have faster and more accurate tools; Due to the utility it has in various network applications; Such as routing management, intrusion detection systems and the performance of transport protocols. Different tools use different estimation techniques but generally only analyze the three most used metrics as av_bw, relative error and estimation time. This work expands the information regarding the evaluation literature of the current Available Bandwidth Estimation Tools (ABET's), where they analyze the estimation techniques, metrics, different generation tools of cross-traffic and evaluation testbed; Concentrating on the techniques and estimation methodologies used, as well as the challenges faced by open-source tools in high-performance networks of 10 Gbps or higher

Promoting the use of reliable rate based transport protocols: the Chameleon protocol

Rate-based congestion control, such as TFRC, has not been designed to enable reliability. Indeed, the birth of TFRC protocol has resulted from the need for a congestion-controlled transport protocol in order to carry multimedia traffic. However, certain applications still prefer the use of UDP in order to implement their own congestion control on top of it. The present contribution proposes to design and validate a reliable rate-based protocol based on the combined use of TFRC, SACK and an adapted flow control. We argue that rate-based congestion control is a perfect alternative to window-based congestion control as most of today applications need to interact with the transport layer and should not be only limited to unreliable services. In this paper, we detail the implementation of a reliable rate-based protocol named Chameleon and bring out to the networking community an ns-2 implementation for evaluation purpose

Network emulation focusing on QoS-Oriented satellite communication

This chapter proposes network emulation basics and a complete case study of QoS-oriented Satellite Communication