TY - GEN
T1 - Multi-path scheduling algorithm for real-time video applications in next-generation wireless networks
AU - Fernandez, Juan Carlos
AU - Taleb, Tarik
AU - Hashimoto, Kazuo
AU - Nemoto, Yoshiaki
AU - Kato, Nei
PY - 2008
Y1 - 2008
N2 - In wireless mobile networks, ensuring quality of service (QoS) for real-time video applications is a challenge due to resource limitations. Nowadays, such a problem can be alleviated by exploiting the features of mobile computers equipped with multiple wireless interfaces, which can be used simultaneously for transmission/reception of data belonging to a single application. This increases the throughput but is tied to the packets reordering issue. This paper proposes a scheme for scheduling packets through different paths and minimizing the reordering delay at the receiver side. We consider a QoS negotiation system where active users have a specific amount of bandwidth negotiated with the network by each available interface. To allocate such negotiated bandwidth to users, the network implements a time slot division-based strategy. A new scheduling mechanism is developed by taking into consideration such QoS system. Its performance is evaluated and compared against the most popular scheduling schemes via simulations. The results show that our algorithm outperforms the former scheduling algorithms.
AB - In wireless mobile networks, ensuring quality of service (QoS) for real-time video applications is a challenge due to resource limitations. Nowadays, such a problem can be alleviated by exploiting the features of mobile computers equipped with multiple wireless interfaces, which can be used simultaneously for transmission/reception of data belonging to a single application. This increases the throughput but is tied to the packets reordering issue. This paper proposes a scheme for scheduling packets through different paths and minimizing the reordering delay at the receiver side. We consider a QoS negotiation system where active users have a specific amount of bandwidth negotiated with the network by each available interface. To allocate such negotiated bandwidth to users, the network implements a time slot division-based strategy. A new scheduling mechanism is developed by taking into consideration such QoS system. Its performance is evaluated and compared against the most popular scheduling schemes via simulations. The results show that our algorithm outperforms the former scheduling algorithms.
UR - http://www.scopus.com/inward/record.url?scp=50249187266&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249187266&partnerID=8YFLogxK
U2 - 10.1109/IIT.2007.4430372
DO - 10.1109/IIT.2007.4430372
M3 - Conference contribution
AN - SCOPUS:50249187266
SN - 9781424418411
T3 - Innovations'07: 4th International Conference on Innovations in Information Technology, IIT
SP - 73
EP - 77
BT - Innovations'07
T2 - Innovations'07: 4th International Conference on Innovations in Information Technology, IIT
Y2 - 18 November 2007 through 20 November 2007
ER -