Optical networking technology has experienced remarkable advances in a short time, making it possible to build future Optical Networks that support bursty IP datagrams. This has resulted in numerous e orts to develop optical-burst switching WDM networks for the future Optical Network backbones. However, the optical domain lacks intelligence and cannot process the bursts, leading to increased bl...

An efficient resource sharing strategy is proposed for multimedia wireless networks. Assume the channel resource in a wireless system is partitioned into two sets: one for voice calls and one for video calls. In the proposed channel borrowing strategy, voice calls can borrow channels from those pre-allocated to video calls temporarily when all voice channels are busy. A threshold type decision ...

This paper develops methods to compute performance measures in a specific type of loss system with multiple classes of customers sharing the same processor. Such systems arise in the modeling of a call center, where the performance measures of interest are blocking the probability of a call and the reneging probability of customers that are put on hold. Expressions for these performance measure...

We present an analytical model for the performance evaluation of hypercube computers. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second generation hypercube systems. Probability of blocking and average message delay are the two performance measures discussed here. We start with the communication t r a c to find the probability of blocking. The traffi...

We present an evolutionary programming algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in optical wavelength-division multiplexing (WDM) networks under wavelength continuity constraint. We assume an ideal physical channel and therefore neglect the blocking of connection requests due to the physical impairments. The problem formulation includes suitable constra...

This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in an MPLS network. Coarse granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best effort traffic. On the other hand, fine granularity, such as per-flow, provides lower blocking probabili...

This paper is concerned with the performance evaluation of loss networks. For the simplest networks there are explicit analytical formulae for the important measures of performance , but for networks which involve some level of dynamic control, exact analytical methods have had only limited success. Under several regimes the Erlang Fixed Point (EFP) method provides a good approximation for the ...

In present phase of computer networks calls are managed through ISPs (Internet Service Providers). A large number of people are using high profile electronic media and Internet causing problem of call blocking. Disconnectivity occurs due to blocking, congestions, delay, non-connectivity, Internet call termination, hardware failure etc. but the heavy flow of traffic is the root causes. To reduce...

This study investigates how the Constraint-based routing decision granularity signi cantly a ects the scalability and blocking performance of QoS routing in MPLS network. The coarse-grained granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best-e ort traÆc. On the other hand, the negrained granularity, such as perow, provides lower bloc...

Absfrcrcf-In this paper, we propose a method to calculate the average blocking probability in all-optical networks using limited-rmge wavelength conversion. Previous works have shown that there is a remarkable improvement in blocking probability while using limited-range wavelength conversion [2], [3] but these analytical models were either for a path [2] or for a mesh-torus network [3]. Using ...