Fair and efficient scheduling in data ferrying networks

9 years 3 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologies such as DSL, CDMA, and dial-up. In such a network, an Internet-based proxy gathers data from the Internet and sends it to a set of edge nodes called "gateways", from which data ferries, such as buses and cars, opportunistically pick up the data using short-range WiFi as they drive past, and deliver it wirelessly to kiosks in remote villages. In this context, we pose the following question: assuming knowledge of ferry schedules, when and to which gateway should the proxy send each data bundle so that the overall delay is minimized and the bandwidth is shared fairly among competing kiosks? We show that a well-known schedule-aware routing scheme proposed in the literature, i.e., EDLQ [11] is far from optimal. Moreover, EDLQ does not provide means to enforce bandwidth allocations. To remedy these pro...
Shimin Guo, Srinivasan Keshav
Added 14 Aug 2010
Updated 14 Aug 2010
Type Conference
Year 2007
Authors Shimin Guo, Srinivasan Keshav
Comments (0)