Welcome to the InfoSci Platform
Reference Hub1
Multi-Path Video Streaming in Wireless Networks using Time-Slot based Scheduling

Multi-Path Video Streaming in Wireless Networks using Time-Slot based Scheduling

Juan Carlos Fernandez, Nei Kato
Copyright: © 2008 |Volume: 4 |Issue: 4 |Pages: 11
ISSN: 1548-0631|EISSN: 1548-064X|ISSN: 1548-0631|EISBN13: 9781615201624|EISSN: 1548-064X|DOI: 10.4018/jbdcn.2008100102
Cite Article Cite Article

MLA

Fernandez, Juan Carlos, and Nei Kato. "Multi-Path Video Streaming in Wireless Networks using Time-Slot based Scheduling." IJBDCN vol.4, no.4 2008: pp.13-23. http://doi.org/10.4018/jbdcn.2008100102

APA

Fernandez, J. C. & Kato, N. (2008). Multi-Path Video Streaming in Wireless Networks using Time-Slot based Scheduling. International Journal of Business Data Communications and Networking (IJBDCN), 4(4), 13-23. http://doi.org/10.4018/jbdcn.2008100102

Chicago

Fernandez, Juan Carlos, and Nei Kato. "Multi-Path Video Streaming in Wireless Networks using Time-Slot based Scheduling," International Journal of Business Data Communications and Networking (IJBDCN) 4, no.4: 13-23. http://doi.org/10.4018/jbdcn.2008100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article proposes a scheme for scheduling real-time video packets through different paths in a QoS negotiation system, where active users have specific amounts of bandwidth negotiated with the network by each available interface. The considered QoS negotiation system implements a time-slot division strategy, to allocate the negotiated bandwidth to users. We claim that an efficient scheduling strategy is essential to exploit the features of mobile computers equipped with multiple wireless interfaces, which can be used simultaneously for transmission of data belonging to a single application, while minimizing the reordering delay at the receiver side due to transmission of data via multiple-paths with varying characteristics. A new scheduling mechanism is developed by taking into consideration such QoS systems. The effectiveness of the scheme is verified and compared with the most popular scheduling schemes through extensive simulations. The results demonstrate that our algorithm outperforms the former scheduling algorithms effectively.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.