Design and implementation of the KioskNet system

Guo, Shenyang; Derakhshani, Mohammad; Falaki, M. H.; Ismail, Usman; Luk, Rowena; Oliver, Earl; Rahman, Shams; Seth, Aaditeshwar; Zaharia, Matei; Keshav, Srinivasan

doi:10.1016/j.comnet.2010.08.001

Cited by 30 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We start with recounting a history of Gram Vaani to set the context. Back in 2007, we were deeply inspired with the success that participatory media had seen in facilitating collective action and governance improvement in developed regions [10,11], and wanted to find appropriate solutions that could be applied to developing regions where a straightforward transfer of Internet-based participatory media systems would not be suitable [12]. At the same time, we were also cognizant of the poor credibility assurance provided on participatory media platforms [13], and wanted to find a design that would be both participatory as well as able to ensure credible communication.…”

Section: Strategic Challenges Of Running An Enterprisementioning

confidence: 99%

The Elusive Model of Technology, Media, Social Development, and Financial Sustainability

Seth

2020

Socio-Tech Innovation

View full text Add to dashboard Cite

We recount in this essay the decade-long story of Gram Vaani, a social enterprise with a vision to build appropriate ICTs (Information and Communication Technologies) for participatory media in rural and low-income settings, to bring about social development and community empowerment. Other social enterprises will relate to the learning gained and the strategic pivots that Gram Vaani had to undertake to survive and deliver on its mission, while searching for a robust financial sustainability model. While we believe the ideal model still remains elusive, we conclude this essay with an open question about the reason to differentiate between different kinds of enterprises -commercial or social, for-profit or not-forprofit -and argue that all enterprises should have an ethical underpinning to their work.

show abstract

Section: Strategic Challenges Of Running An Enterprisementioning

confidence: 99%

The Elusive Model of Technology, Media, Social Development, and Financial Sustainability

Seth

2020

Socio-Tech Innovation

View full text Add to dashboard Cite

show abstract

“…In Algorithm 2, we first calculate a solution S (1) returned by a modified version (MODIFIEDGREEDY) of the greedy algorithm (line 1). The differences between the greedy algorithm (e.g., Algorithm 1) and MODIFIEDGREEDY, are that the latter: (a) each time selects to add in the cache the content that increases the most the fraction of the objective function over its own size (line 13), and (b) considers every content, until there is no content that can fit in the cache (lines [14][15][16][17][18][19][20]. Then, Algorithm 2 calculates the solution S (2) that the greedy algorithm would return if all contents were of equal size (line 2).…”

Section: Appendix C Proof Of Lemmamentioning

confidence: 99%

Femto-Caching with Soft Cache Hits: Improving Performance with Related Content Recommendation

Sermpezis

Spyropoulos

Vigneri

et al. 2017

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

View full text Add to dashboard Cite

Pushing popular content to cheap "helper" nodes (e.g., small cells) during off-peak hours has recently been proposed to cope with the increase in mobile data traffic. User requests can be served locally from these helper nodes, if the requested content is available in at least one of the nearby helpers. Nevertheless, the collective storage of a few nearby helper nodes does not usually suffice to achieve a high enough hit rate in practice. We propose to depart from the assumption of hard cache hits, common in existing works, and consider "soft" cache hits, where if the original content is not available, some related contents that are locally cached can be recommended instead. Given that Internet content consumption is entertainment-oriented, we argue that there exist scenarios where a user might accept an alternative content (e.g., better download rate for alternative content, low rate plans, etc.), thus avoiding to access expensive/congested links. We formulate the problem of optimal edge caching with soft cache hits in a relatively generic setup, propose efficient algorithms, and analyze the expected gains. We then show using synthetic and real datasets of related video contents that promising caching gains could be achieved in practice.

show abstract

“…In order to provide low cost Internet connectivity to fixed kiosks in rural areas of developing counties, KioskNet architecture has been proposed [11]. In this architecture, buses carry data between the kiosks and a set of gateways that can communicate to a proxy on the Internet.…”

Section: Related Workmentioning

confidence: 99%

Timely Data Delivery in a Realistic Bus Network

Acer¹,

Giaccone

Hay

et al. 2012

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the routing problem in such a network. Assuming the bus schedule is known, we maximize the delivery probability by a given deadline for each packet. Our approach takes the randomness into account, which stems from road traffic conditions, passengers boarding and alighting, and other factors that affect the bus mobility. In this sense, this paper is one of the first to tackle quasi-deterministic mobility scenarios. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, maximizing the delivery probability over an infinite time-horizon, and a recently proposed heuristic based on bus frequencies. We show that our optimal algorithm shows the best performance, but it essentially reduces to minimizing the expected traversal time. When transmissions fail frequently (more than half of the times), the algorithm behaves similarly to a heuristic that maximizes the delivery probability over an infinite time-horizon. For reliable transmissions and values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to almost reach the performance of the costly flooding approach. I. INTRODUCTION We consider an opportunistic data network formed by (some) buses and bus stops in a town equipped with wireless devices, e.g. based on WiFi technologies, like in DieselNet [1]. Most of the stops act as disconnected relay nodes (the throwboxes in [2]), and a few of them are also connected to the Internet. Data are delivered across the town following the store-carry-forward network paradigm [3], based on multihop communication in which two nodes may exchange data

show abstract

Design and implementation of the KioskNet system

Cited by 30 publications

References 11 publications

The Elusive Model of Technology, Media, Social Development, and Financial Sustainability

The Elusive Model of Technology, Media, Social Development, and Financial Sustainability

Femto-Caching with Soft Cache Hits: Improving Performance with Related Content Recommendation

Timely Data Delivery in a Realistic Bus Network

Contact Info

Product

Resources

About