Learn More
—We consider a slotted WDM packet switch with limited-range wavelength converters. The performance of this switch is studied using simulations with various types of data traffic. Results show that the slotted WDM packet switch with a small range of wavelength conversion capability can achieve a performance close to that of a switch with the full range of(More)
We develop a framework for optimal rate allocation and routing in multihop wireless networks. Each node in the network has delay-sensitive data to send to a unique destination and this data can be sent over a single (multihop) path through the network or via multiple paths. Sending over multiple paths can increase throughput and reduce congestion. Our goal(More)
This paper presents heuristic algorithms that may be used for light-path routing and wavelength assignment in optical WDM networks under dynamically varying traf®c conditions. We consider both the situations where the wavelength continuity constraint is enforced or not enforced along a light-path. The performance of these algorithms has been studied through(More)
We consider WDM networks with lightpath switching where wavelengths may be converted, as required, along the lightpath. For efficient converter usage in such a network, sparse converter placement may be followed where only some of the network nodes are equipped with wavelength converters. Given the nominal network traffic pattern, we present a simple(More)
—This letter analyzes an all-optical packet switch based on fiber loop buffer memory (FLBM). The number of recircula-tions of a packet in the fiber loop is limited by noise constraints whereas the total number of packets stored in the fiber loop is constrained by the number of available wavelengths. The switch operates as an output-queued switch with these(More)
In this paper we describe an approximate method for the analysis of an open network of finite capacity queues. Finite buffer capacities at the nodes introduce blocking of jobs that finish service at a node and find that the destination node is full at that time. When this happens, we assume that the blocked job is held at the server of the queue where it(More)
In this paper we describe QNAT, a software tool developed at Indian Institute of Technology, Kanpur, India, for the analysis and simulation of queueing networks. Arbitrary configurations of open or closed networks of multi-server queues with infinite or finite capacity, fork-join queues with or without synchronization queues can be analyzed or simulated(More)