Skip to Main content Skip to Navigation
Conference papers

Optimal Link Deployment for Minimizing Average Path Length in Chain Networks

Abstract : This study considers chain-topology networks, which has certain inherent limitations, and presents an optimization model that augments the network by the addition of a new link, with the objective of minimizing Average Path Length (APL).We built up a mathematical model for APL, and formulated our problem as Integer Programming. Then, we solved the problem experimentally by brute-force, trying all possible topologies, and found the optimal solutions that minimize APL for certain network sizes up to 1000 nodes. Later on, we derived analytical solution of the problem by applying Linear Regression method on the experimental results obtained.We showed that APL on a chain-topology network is decreased by the proposed optimization model, at a gradually increasing rate from 24.81 % to asymptotic value of 41.4 % as network grows. Additionally, we found that normalized length of the optimal solutions decreases logarithmically from 100 % to 58.6048 % as network size gets larger.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01434864
Contributor : Hal Ifip <>
Submitted on : Friday, January 13, 2017 - 2:34:46 PM
Last modification on : Friday, January 13, 2017 - 2:45:31 PM
Long-term archiving on: : Friday, April 14, 2017 - 7:54:31 PM

File

417220_1_En_27_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Zeki Bilgin, Murat Gunestas, Omer Demir, Sahin Buyrukbilen. Optimal Link Deployment for Minimizing Average Path Length in Chain Networks. 14th International Conference on Wired/Wireless Internet Communication (WWIC), May 2016, Thessaloniki, Greece. pp.348-359, ⟨10.1007/978-3-319-33936-8_27⟩. ⟨hal-01434864⟩

Share

Metrics

Record views

173

Files downloads

251