Sciweavers

54 search results - page 6 / 11
» Flow trees for vertex-capacitated networks
Sort
View
INFORMS
2008
241views more  INFORMS 2008»
13 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
ECML
2007
Springer
13 years 11 months ago
Modeling Highway Traffic Volumes
Most traffic management and optimization tasks, such as accident detection or optimal vehicle routing, require an ability to adequately model, reason about and predict irregular an...
Tomás Singliar, Milos Hauskrecht
COMCOM
2006
110views more  COMCOM 2006»
13 years 7 months ago
MULTI+: A robust and topology-aware peer-to-peer multicast service
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack
IDA
2010
Springer
13 years 9 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
HPCA
2005
IEEE
14 years 7 months ago
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead...
Finbar Naven, Ian Johnson, José Duato, Jose...