344 search results - page 28 / 69 » The Directed Minimum Latency Problem |
101
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
NOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
—Circuit-switched networks can significantly lower the communication latency between processor cores, when compared to packet-switched networks, since once circuits are set up, ...
113
click to vote
SIGCOMM
2005
ACM
15 years 5 months ago
2005
ACM
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
102
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
122
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...