Sciweavers

50 search results - page 6 / 10
» When Does Opportunistic Routing Make Sense
Sort
View
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
15 years 11 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
INFOCOM
2000
IEEE
15 years 10 months ago
REUNITE: A Recursive Unicast Approach to Multicast
—We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP add...
Ion Stoica, T. S. Eugene Ng, Hui Zhang
COR
2006
99views more  COR 2006»
15 years 5 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
MP
2010
119views more  MP 2010»
15 years 4 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
ACSC
2000
IEEE
15 years 10 months ago
Needles and Haystacks: A Search Engine for Personal Information Collections
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
Owen de Kretser, Alistair Moffat