We consider the problem of finding a single-path intra-domain routing for time-varying traffic. We characterize the traffic variations by a finite set of traffic profiles with given non-zero fractions of occurrence. Our goal is to optimize the average performance over all of these traffic profiles. We solve the optimal multi-path version of this problem using linear programming and develop heur...

In Delay Tolerant Networks (DTNs), two-hop routing compromises energy versus delay more conveniently than epidemic routing. Literature provides comprehensive results on optimal routing policies for mobile nodes with homogeneous mobility, often neglecting signaling costs. Routing policies are customarily computed by means of fluid approximation techniques, which assure solutions to be optimal on...

In this talk, we consider a location-routing problem in designing the optical Internet with WDM systems. This problem arises from the design of broadband local access networks that deliver high-speed access service to residential subscribers. In this problem, we consider fiber routing and gateway location. For routing problem, we determine the optimal dimensioning of link capacity, and seek to ...

We describe a \topology advisor" for routing of critical (multi-source) buses in building-block design. The tool accepts as input a block layout, a two-layer routing cost structure superposed over the block layout, terminal locations for a multi-source bus, and source-sink delay upper bound (linear or Elmore delay) constraints for all terminal pairs. The b best routing solutions (b a user param...

We describe a \topology advisor" for routing of critical (multisource) buses in building-block design. The tool accepts as input a block layout, a two-layer routing cost structure superposed over the block layout, terminal locations for a multi-source bus, and source-sink delay upper bound (linear or Elmore delay) constraints for all terminal pairs. The b best routing solutions (b a user parame...

The design of the placement and routing for an FPGA (whether it’s a traditional or coarse grained field programmable gate arrays) is very important process, requiring the care about the flexibility with silicon efficiency. With the motivation growing towards embedding FPGAs into SoC (system on chip) designs, final requirements for the FPGA architectures becomes more critical. The identification...

There are two major difficulties in real-time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real-time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real-time multicast connection setup mechanism, which ...