Quality of service based multipath routing for supporting real time wireless applications
Jian Zhao, Bosheng Zhou, Jieyi Wu
Abstract
Jian Zhao, Bosheng Zhou, Jieyi Wu
Abstract
In this paper,we discuss the quality of service (QoS) routing support issues for real time end-to-end applications in wireless networks. Taking the characteristics of wireless communications such as roaming mobility and power consumption into account, it will be better to provide multipath routing support than single path strategy from the application points of view so that when a terminal moving away or other random events cause a single path to fail, there will still be other backup paths that can be used. Based on this consideration, we propose one multipath QoS routing algorithm which is implemented through network graph scanning forward and backward. These multiple paths are disjointed. We can avoid the case that one down or failing link may cause more than one path to be unusable. In our simulation experiments, we compare it with other multipath strategies such as iterative OSPF (open shortest path first) in the number of found paths and delay time adapting to terminal mobility.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,we discuss the quality of service (QoS) routing support issues for real time end-to-end applications in wireless networks. Taking the characteristics of wireless communications such as roaming mobility and power consumption into account, it will be better to provide multipath routing support than single path strategy from the application points of view so that when a terminal moving away or other random events cause a single path to fail, there will still be other backup paths that can be used. Based on this consideration, we propose one multipath QoS routing algorithm which is implemented through network graph scanning forward and backward. These multiple paths are disjointed. We can avoid the case that one down or failing link may cause more than one path to be unusable. In our simulation experiments, we compare it with other multipath strategies such as iterative OSPF (open shortest path first) in the number of found paths and delay time adapting to terminal mobility.
Key concepts: Computer science, Multipath routing, Computer network, Backup, Roaming, Multipath propagation, Distributed computing, Quality of service