Delay Optimized Small-World Networks

Abstract

Many regular networks suffer from significant network delay due to large end-to-end hop distance among source nodes and destination nodes in the network. However, the presence of a few long-ranged links transforms a regular network to a small-world network, and thus, optimizes network delay by minimizing end-to-end hop distance. In this paper, we study various deterministic long-ranged link addition strategies (e.g., based on average path length, average edge length, betweenness centrality, closeness centrality, and closeness centrality disparity) to incorporate small-world characteristics as well as to optimize average network delay of the network. Moreover, we analyze time complexity to assess the efficiency of each strategy in detail. We observe, in an N node network, that deterministic long-ranged link addition by closeness centrality disparity (CCD) strategy is only O(N 2 × log N ) time complex compared to other optimal long-ranged link addition strategies which take O(N 4 × log N ) time to achieve similar performance in the context of average network delay.Index Terms-Regular network, small-world network, average network delay, closeness centrality, closeness centrality disparity.

A Survey on the Network Models applied in the Industrial Network Optimization

“…Therefore, the introduction of a small number of long-range connected edges can make a regular network or a random network into a small-world network. The small-world network feature reduces network latency [57].…”

“…Community detection [89] Industrial wireless sensor networks [10][11] Delay Tolerant Networks (DTNs) [58] Detection of the community structure of smart city network system [59] Topology planning [88] Grid system [31] East China power grid [32] HUST WU WUT CSU SYSU [29] Network attack [98] Wireless sensor network [92] User-side big data balanced partitioning [94] The end-to-end TCP [91] Job scheduling [60] Joint localization and data acquisition in wireless sensor networks [85][86] Optimize the average network latency of the network [57] Information center network [51] Network routing [12] cally the following, power consumption, delay, ductility, robustness. Figure .7 summarizes the industrial interconnection network topology mentioned above.…”

KL-Dection: An Approach to Detect Network Outages Based on Key Links

“…As can be seen from Table 2, only one metric of the first three links does not satisfy Equation (8), and the last link only satisfies the condition of flow density. Then, we leverage these four links to detect the outage event mentioned above, and the RTT of these four links is given in Figure 5.…”

“…The reasons lie in the following: (1) monitoring the network performance of all links needs to perform a bulk of measurement tasks. These tasks will inject extra traffic into the network, which may occupy the link bandwidth, reduce the network transmission speed, and increase the network burden [8,9]. (2) Monitoring all links in detection area needs to deploy more probes, and managing the probes is costly for network operators (e.g., periodic maintenance and electricity costs).…”

“…In detail, (1) active probing injects a mass of traffic into the network. Monitoring all the links may occupy the link bandwidth, reduce the network transmission speed, and increase the network burden [8,9]. (2) Active probing is subject to its scalability.…”