Abstract
This paper considers an exact bi-objective approach for simultaneously minimizing the total cost of flow routing and the network bottleneck when link qualities and flow weights are relevant. This is useful for wireless multi-hop networks with long-term TCP (Transmission Control Protocol) flows. The introduced proposal can generate a minimal complete set of Pareto-optimal solutions. Our proposal is evaluated through simulation in which are explored different parameter settings and metrics.
Highlights
Wireless multi-hop networks, which is common to have different link qualities, have been widely investigated [1, 2]
Flow routing is specially useful for TCP (Transmission Control Protocol) flows, which are still dominant in the present and in the foreseeable future when video streaming exceeds 80% of all Internet traffic [7]
In this work, based on the -constraint approach, we introduced a flow routing proposal that takes into account the link qualities and the flow weights
Summary
Wireless multi-hop networks, which is common to have different link qualities, have been widely investigated [1, 2]. Wireless mesh networks are becoming common in companies and households, while wireless sensors networks and vehicular networks are important building block for the smart cities [11, 14] In these networks, routing is essential for efficient utilization of the available capacity by distributing the traffic through multiple paths while taking into consideration the quality of the links [9, 10]. Berman et al [4], Martins [12], Gadegaard et al [8] and Bornstein et al [5] present exact algorithms for bi-objective problems in networks with cost and bottleneck functions, but in these works each network link (i, j) has a value bij associated with the bottleneck function.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
