Sciweavers

135 search results - page 12 / 27
» Hierarchical source routing using implied costs
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 8 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
INFOCOM
2007
IEEE
14 years 1 months ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra
REFSQ
2010
Springer
13 years 6 months ago
Ambiguity Detection: Towards a Tool Explaining Ambiguity Sources
Abstract. [Context and motivation] Natural language is the main representation means of industrial requirements documents, which implies that requirements documents are inherently ...
Benedikt Gleich, Oliver Creighton, Leonid Kof
P2P
2008
IEEE
137views Communications» more  P2P 2008»
14 years 2 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack