Abstract
Real-world communication networks are complex networks, but designing load-balancing routing strategies in complex networks is not an easy task, especially when the traffic demand is under uncertainty. To hedge against such uncertainty, we propose a demand-oblivious routing strategy in complex networks (DOR-CN). Unlike traditional optimization-model-based methods, DOR-CN decouples the routing calculation with traffic demand by a randomized routing algorithm following the oblivious routing paradigm, and is able to achieve load-balancing without knowing the accurate traffic demand. In order to avoid the embedding distortion of complex networks, DOR-CN transfers the metric space of classical oblivious routing into the hyperbolic space. Theoretical derivation can prove that for arbitrary traffic demand matrix, the network congestion of DOR-CN routing strategy is under guaranteed. Experimental results demonstrate that DOR-CN can not only reduce network congestion, but also achieve better load-balancing performance and lower risk of route failures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AEU - International Journal of Electronics and Communications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
