Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shimin Guo

dblp:62/3337 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2011
0000-0002-6954-2647ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet of things and sensor networks · 43% Network optimization and economics · 25% Wireless networking · 25%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
delay tolerant networks
0.122007
Low-cost communication for rural internet kiosks using mechanical backhaul · MobiCom 2006
Fair and efficient scheduling in data ferrying networks · CoNEXT 2007
Wireless networking
fair scheduling
0.112007
Fair and efficient scheduling in data ferrying networks · CoNEXT 2007
Network optimization and economics
resource allocation
0.112007
Fair and efficient scheduling in data ferrying networks · CoNEXT 2007
Internet of things and sensor networks › delay tolerant networks
data muling
0.012007
Fair and efficient scheduling in data ferrying networks · CoNEXT 2007
Internet architecture and protocols
naming and addressing
0.012006
Low-cost communication for rural internet kiosks using mechanical backhaul · MobiCom 2006

Methods — techniques the papers use, named apart from their topics

token bucket · 0.1minimum-cost network flow · 0.1prototype implementation · 0.1
YearPublicationVenuePosition
2011 Design and implementation of the KioskNet system
Shimin Guo, Mohammad Derakhshani, Hossein Falaki, Usman Ismail, Rowena Luk, Earl A. Oliver, Sumair Ur Rahman, Aaditeshwar Seth, Matei Zaharia, Srinivasan Keshav
Comput. Networks1
2007 Fair and efficient scheduling in data ferrying networks
abstract
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 problems, we employ a token bucket mechanism to decouple fairness and delay minimization concerns. We also describe a utility-maximizing scheduler based on the classical minimum-cost network flow problem, that finds optimal schedules. Through simulations, we show that our scheme performs at least as well as EDLQ in scenarios that favour EDLQ, yet achieves up to 40% reduction in delay in those that do not.
Shimin Guo, Srinivasan Keshav
CoNEXT1
2007 Design and implementation of the KioskNet system
abstract
Rural Internet kiosks in developing countries can cost-effectively provide communication and e-governance services to the poorest sections of society. Unfortunately, a variety of technical and non-technical issues have caused most kiosk deployments to be unsustainable [1]. KioskNet addresses the key technical problems underlying kiosk failure by using robust ‘mechanical backhaul’ for connectivity [2], and by using low-cost and reliable kiosk controllers to support services delivered from one or more recycled PCs. KioskNet also addresses related issues such as security, user management, and log collection. In this paper, we describe the KioskNet system and outline its hardware, software, and security architectures. We describe a pilot deployment, and how we used lessons from this deployment to re-design our initial prototype.
Shimin Guo, Hossein Falaki, Earl A. Oliver, Sumair Ur Rahman, Aaditeshwar Seth, Matei Zaharia, Usman Ismail, Srinivasan Keshav
ICTD1
2006 Low-cost communication for rural internet kiosks using mechanical backhaul
abstract
Rural kiosks in developing countries provide a variety of services such as birth, marriage, and death certificates, electricity bill collection, land records, email services, and consulting on medical and agricultural problems. Fundamental to a kiosk's operation is its connection to the Internet. Network connectivity today is primarily provided by dialup telephone, although Very Small Aperture Terminals (VSAT) or long-distance wireless links are also being deployed. These solutions tend to be both expensive and failure prone. Instead, we propose the use of buses and cars as "mechanical backhaul" devices to carry data to and from a village and an internet gateway. Building on the pioneering lead of Daknet [15], and extending the Delay Tolerant Networking Research Group architecture [24], we describe a comprehensive solution, encompassing naming, addressing, forwarding, routing, identity management, application support, and security. We believe that this architecture not only meets the top-level goals of low cost and robustness, but also exposes fundamental architectural principles necessary for any such design. We also describe our experiences in implementing a prototype of this architecture.
Aaditeshwar Seth, D. Kroeker, Matei Zaharia, Shimin Guo, Srinivasan Keshav
MobiCom4
2000 Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures
Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi
ISAAC2