830 search results - page 80 / 166 » Generalizing Global Constraints Based on Network Flows |
SIGCOMM
2004
ACM
14 years 2 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
DAC
2007
ACM
14 years 10 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
JSAC
2006
13 years 8 months ago
2006
Abstract--We present a novel approach for joint optical network provisioning and Internet protocol (IP) traffic engineering, in which the IP and optical networks collaboratively op...
DAC
2009
ACM
14 years 10 months ago
2009
ACM
In this paper, we present an NoC (Networks-on-Chip) router with an SDRAM-aware flow control. Based on a priority-based arbitration, it schedules packets to improve memory utilizat...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...