Traffic Demand Matrix Research Articles

Improved Approaches for Cost-Effective Traffic Grooming in WDM Ring Networks: Uniform-Traffic Case.

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of two new traffic-grooming approaches for WDM ring networks, called single-hop and multihop. Our single-hop implementation uses the simulated-annealing heuristic. After placing all the traffic on “virtual circles”, we group the circles in order to reduce the number of ADMs in the network. Our multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix; then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the “hub” node which has an ADM for each wavelength. The hub node, therefore, can “bridge” traffic between all of the wavelengths. Each algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach based on simulated annealing for a small grooming ratio, but for a large grooming ratio and node number, we advocate the use of the multihop approach.

Scheduling Algorithms for Star-Coupled WDM Networks with Tunable Transmitter and Tunable Receiver Architecture

This paper presents the design and analysis of two scheduling algorithms for a reservation-based medium access control (MAC) protocol for wavelength division multiplexed (WDM) multi-channel optical networks. The network architecture is based on a passive star topology with one tunable transmitter and receiver (TT-TR) per node. The main objective of scheduling algorithm design is to reduce the computation time while maximizing the utilization of the network resources. In this paper, we propose two scheduling schemes called SEQSAM (SEQuential Scheduling AlgorithM) and BALSAM (BALanced Scheduling AlgorithM). Let M denote the number of nodes, C the number of channels, and K the maximum number of packets transmitted by one node to another. SEQSAM uses the M × M traffic demand matrix--obtained during the reservation phase of the MAC protocol--to compute a collision-free schedule for the nodes of the network. BALSAM uses the modified MULTI-FIT algorithm (MMFT) [1] to convert the M × M matrix into a corresponding M × C matrix, which is input to the IBS (Interval Based Scheduling) algorithm [2] that schedules the requests of the nodes. The overall time complexity of SEQSAM is O(M3) compared to BALSAM algorithm's time complexity of O(M2CK + M2 + MlogM). Note that the lower bound for any scheduling algorithm operating on a M × M matrix is O(M2). A simulation-based performance study that considers network utilization, computation time, tuning latency, average packet latency and throughput for 1.2 Gbps and 2.4 Gbps data streams is presented.

Design of wavelength-routed optical networks for packet switched traffic

We consider the problem of designing a logical optical network topology for a given physical topology (or fiber layout) and a given traffic demand matrix between the end-users. Traffic between the end-users is carried in a packet-switched form and the objective of our logical topology design is to minimize the maximum congestion on the logical connections in the logical topology. The logical connections are realized by wavelength continuous paths or lightpaths between end-users and they are routed via wavelength-selective routers. Note that a topology with lower maximum link congestion will allow its traffic demand matrix to be scaled up by a larger factor. In the logical topology each node is equipped with a limited number of optical transceivers, hence logical connections cannot be set up between every pair of nodes. In this paper we present an improved lower bound for maximum congestion on any link In the logical topology. The bound is shown to be up to 50% higher than the existing ones. An analytical model for obtaining the maximum and average logical connection loads for a given logical network and traffic demand matrix is also formulated, and it has been confirmed via simulation. Finally, two heuristic algorithms for constructing a logical topology that reduces maximum logical connection congestion are presented.

Capacitated Network Design—Polyhedral Structure and Computation

We study a capacity expansion problem that arises in telecommunication network design. Given a capacitated network and a traffic demand matrix, the objective is to add capacity to the edges, in multiples of various modularities, and route traffic, so that the overall cost is minimized. We study the polyhedral structure of a mixed-integer formulation of the problem and develop a cutting-plane algorithm using facet defining inequalities. The algorithm produces an extended formulation providing both a vary good lower bound and a starting point for branch and bound. The overall algorithm appears effective when applied to problem instances using real-life data.

An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams

In this paper we consider an SS/TDMA system with M uplink beams and N downlink beams, where uplink beam i has bandwidth β i and downlink beam j has bandwidth α j . The maximum traffic which can be handled by the satellite (in any given time slot) is assumed to be K . Multiplexing and demuitiplexing are also assumed. An optimal time slot assignment algorithm to minimize the total transmission time for any given traffic demand matrix is proposed and analyzed. Other system configurations of interest are also discussed.