K. M. Sivalingam, J. Wang, X. Wu, and M. Mishra, "Improved On-line Scheduling Algorithms for Optical WDM Networks," in DIMACS Workshop on Multichannel Optical Networks, pp. 43--61, Mar. 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Supporting Bursty Traffic with Bandwidth Guarantee in WDM.. - Kam, Siu (2000) (1 citation) (Correct)
....choice of wavelength subsets can alleviate the wavelength contention problem as well. 2.5 Related Work There has been a lot of work on the problem of wavelength contention in a metropolitan area or local area optical network. Most of them, like our work, employ scheduling based MAC protocols [3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]. Typically, the input trac is abstracted as a trac matrix. In many cases, the trac pattern is all to all, and in some cases (e.g. 11] the trac matrix is uniform, i.e. every entry has value 1. In the vast majority of cases, each node has the same transceiver capabilities, e.g. either all ....
K.M. Sivalingam, J. Wang, X. Wu, and M. Mishra, \Improved on-line scheduling algorithms for optical wdm networks," in Discrete Mathematics and Theoretical Computer Science (DIMACS) ' Workshop on Multichannel Optical Networks, New Brunswick NJ, Mar. 1998, pp. 43-61. 22
Scheduling in WDM Networks with Tunable Transmitter and.. - Mishra, Sivalingam (1999) Self-citation (Sivalingam Mishra) (Correct)
....BALSAM scheduling algorithm is to schedule these requests on the C channels in a collision less manner. The proposed solution uses the MULTI FIT algorithm [5] to convert the demand matrix into a M Theta C form. This M Theta C matrix is then input to the IBS (Interval Based Scheduling) algorithm [6], which computes the transmitter to channel allocation schedule for the frame. In this paper, we have conducted a performance study of the BALSAM algorithm and have computed the network utilization, throughput and computation time of the algorithm for varying number of nodes of the network. In ....
....to the same channel are added up. This returns an assignment of receivers to channels, effectively balancing the traffic carried across all the channels. With this receiver to channel assignment the original M Theta M matrix is converted into a M Theta C matrix. This is then input to the IBS [6] algorithm which assigns time slots on the C channels to the M nodes. The algorithm is better explained by the following example. Consider a system with M = 4 and C = 2. Let the given Demand Matrix be D = 6 6 6 0 3 2 2 1 0 4 0 3 2 0 1 1 1 3 0 7 7 7 5 The column sums ( j S ij ) of ....
[Article contains additional citation context not shown here]
K. M. Sivalingam, J. Wang, X. Wu, and M. Mishra, "Improved On-line Scheduling Algorithms for Optical WDM Networks," in DIMACS Workshop on Multichannel Optical Networks, pp. 43--61, Mar. 1998.
Scheduling in Optical WDM Networks using Hidden Markov.. - Mishra, Johnson.. (2000) (1 citation) Self-citation (Sivalingam Mishra) (Correct)
....the data transfer phase during which the actual data transfer takes place between the nodes of the network. Corresponding Author. Internet and Communications Lab, Intel s Architecture Labs, 2111 NE 25th Avenue, Hillsboro, OR 97124 5961, USA. 2. 3 Scheduling Algorithms It has been shown in [3] that OIS executes in linear time of M with a time complexity of O(MC K) where K is the largest possible entry in the demand matrix. The algorithm contains only simple operations thereby enabling hardware implementation. OIS is online since it processes the node s requests one by one ....
....of free slots on the channel. The node s list of intervals is also checked to determine if it is scheduled to transmit on any other channel during the time interval requested. After the allocation has been made, the lists are updated. The mathematical and implementation details are available in [3]. 3 Predictive Online Scheduling Algorithm (POSA) In this section, we present a scheme called Predictive Online Scheduling Algorithm POSA which is based on predicting the traffic matrix that is input to OIS. The predictor model proposed in this paper is primarily based upon the Hidden Markov ....
K. M. Sivalingam, J. Wang, X. Wu, and M. Mishra, "Improved On-line Scheduling Algorithms for Optical WDM Networks," in DIMACS Workshop on Multichannel Optical Networks, (New Brunswick, NJ), pp. 43--61, Mar. 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC