Showing papers by "Shivendra S. Panwar published in 1993"

Topological design of interconnected LAN/MAN networks

Abstract: The authors describe a methodology for designing interconnected LAN/MAN networks with the objective of minimizing the average network delay. They consider IEEE 802 standard LANs interconnected by transparent bridges. These bridges are required to form a spanning tree topology. The authors propose a simulated annealing-based algorithm for designing minimum delay spanning tree topologies. In order to measure the quality of the solutions, a lower bound for the average network delay is found. The algorithm is extended to design the overall LAN/MAN topology consisting of a MAN or high-speed data service interconnecting several clusters of bridged LANs. Comparison with the lower bound and several other measures show that the solutions are not very far from the global minimum. >

Optimal buffer control during congestion in an ATM network node

Abstract: The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified. >

Collision resolution algorithms for a time-constrained multiaccess channel

Abstract: Collision resolution algorithms (CRAs) for the ternary feedback multiple access channel with time constraints are considered. The authors wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A nonnested CRA is described and its performance is compared with a nested CRA for values of K >

Topological design of multihop lightwave networks

Abstract: One of the promising lightwave network architectures is the multihop lightwave networks based on wavelength division multiplexing (WDM). In this architecture, separate channels created by assigning different wavelengths between node pairs define the logical connectivity. This logical topology is independent of the underlying physical topology and can be adaptively changed according to the changing traffic patterns and connectivity requirements. One of the possible objectives for designing this logical topology is minimizing the maximum utilization on any link by choosing the logical connectivity and finding the optimum routing. This paper describes an algorithm based on simulated annealing for solving the joint logical topology design and routing problem. Different algorithms were implemented for the cases with bifurcated and shortest path routing. Computational experiments showed that the simulated annealing solutions are as good as or better than the solutions found in previous studies. >

Interconnected LAN/MAN Networks

Abstract: This paper describes a methodology for designing interconnected LAN/MAN networks with the objective of mini- mizing the average network delay. We first consider IEEE 802 standard LAN's interconnected by transparent bridges. These bridges are required to form a spanning tree topology. We propose a simulated annealing-based algorithm for designing minimum delay spanning tree topologies. In order to measure the quality of the solutions, we find a lower bound for the average network delay. We extend the algorithm to design the overall LAN/MAN topology consisting of a MAN or high-speed data service interconnecting several clusters of bridged LAN's. Comparison with the lower bound and several other goodness measures show that the solutions are not very far from the global minimum.