In emerging network technologies designed to support a variety of services, it is common to find that the packet switching service is implemented on top of a facility network. For example, in typical narrowband ISDN architectures, the packet switches installed a t some of the central offices (CO's) a r e interconnected with trunks derived from an underlying channelized facility network. Likewise, in future broadband ISDN's, the ATM switches will he connected with trunks obtained from a n underlying "pool" of fiber facilities interconnected by digital cross connect systems (DCS). In this paper, we address the design of a P/S network embedded into a backbone facility network. We formulate the problem as a network optimization problem where a congestion measure based on the average packet delay is minimized, subject to capacity constraints posed by the underlying facility trunks. The variables in this problem a r e the routing on the "express" pipes (i.e., the channels that interconnect the PIS modes), and the allocation of bandwidth to such pipes. We present a n efficient algorithm for the solution of the above problem and apply it to some representative examples. We show that for some test cases, the congestion measure is substantially reduced with respect to the values obtained when the embedded topology is kept identical to the hackbone topology. We also discuss dynamic reconfiguration schemes where the embedded topology is periodically adjusted to track the fluctuations in traffic requirements.

Minimum Interference Routing is instrumental to MPLS Traffic Engineering under realistic assumptions of unknown traffic demand. This work presents a new algorithm for minimum interference routing, called Light Minimum Interference Routing (LMIR). This algorithm introduces a new approach for critical link identification that reduces the computational complexity. Results, derived via simulation, show that LMIR is precise and has indeed a low computational complexity.

No abstract

No abstract