Sciweavers

31 search results - page 3 / 7
» A partition approach to the inventory routing problem
Sort
View
ECIR
2007
Springer
13 years 9 months ago
A Decision-Theoretic Model for Decentralised Query Routing in Hierarchical Peer-to-Peer Networks
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional “resource ...
Henrik Nottelmann, Norbert Fuhr
INFOCOM
2005
IEEE
14 years 1 months ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 4 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
KIVS
2011
Springer
12 years 10 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
NGC
2000
Springer
115views Communications» more  NGC 2000»
13 years 11 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi