12.07.2015 Views

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010 145out which messages should not be <strong>in</strong> the same groupbecause they will cause crosstalk <strong>in</strong> the network. A set <strong>of</strong>connections is partitioned <strong>in</strong>to several subsets such thatthe connections <strong>in</strong> each subset can be establishedsimultaneously <strong>in</strong> a network. There is no crosstalk <strong>in</strong>these subsections. This approach makes importance <strong>in</strong>optical MINs for various reasons. First, most <strong>of</strong> themultiprocessors use electronic processors and opticalMINs. There is a big mismatch between the slowprocess<strong>in</strong>g speed <strong>in</strong> processors and the highcommunication speed <strong>in</strong> networks carry<strong>in</strong>g opticalsignals [15]. Second, there is a mismatch between therout<strong>in</strong>g control and the fast signal transmission speed. Toavoid crosstalk, the TDM approach is used, where the set<strong>of</strong> messages are partitioned <strong>in</strong>to several groups such thatthe messages <strong>in</strong> each group can be sent simultaneouslythrough the network without any crosstalk.VI. METHODS FOR MESSAGE PARTITIONING INTDM APPROACHA. W<strong>in</strong>dow methodW<strong>in</strong>dow method is the method that is used to f<strong>in</strong>d themessages that are not <strong>in</strong> the same group because it causescrosstalk <strong>in</strong> the network. If we consider the network <strong>of</strong>size N x N, there are N source and N dest<strong>in</strong>ation address.Comb<strong>in</strong><strong>in</strong>g source and its dest<strong>in</strong>ation address formscomb<strong>in</strong>ation matrix. From this, optical w<strong>in</strong>dow size is M-1 where M = log 2 N and N is size <strong>of</strong> network. In w<strong>in</strong>dowmethod, the number <strong>of</strong> w<strong>in</strong>dows is equal to the number <strong>of</strong>stages [11].After f<strong>in</strong>d<strong>in</strong>g conflicts us<strong>in</strong>g w<strong>in</strong>dow method,conflict graph is generated shown <strong>in</strong> figure. The number<strong>of</strong> nodes is the size <strong>of</strong> the network. The nodes that arehav<strong>in</strong>g conflict are connected through edge. Degree <strong>of</strong>each message is the number <strong>of</strong> conflicts to the othermessage. Conflict graph is shown <strong>in</strong> figure 4.Figure 4. Conflict graphThe conflict matrix is a square matrix with N x Nentry, it consists <strong>of</strong> the output <strong>of</strong> the w<strong>in</strong>dow method, asshown <strong>in</strong> figure 5. The def<strong>in</strong>ition <strong>of</strong> Conflict Matrix is thematrix M ij with size N x N. N is the size <strong>of</strong> the network.B. Improved w<strong>in</strong>dow methodIn this method the first w<strong>in</strong>dow is elim<strong>in</strong>ated for thiswe make the conflict matrix <strong>in</strong>itialized to 0, here Number<strong>of</strong> w<strong>in</strong>dows is M-1. It takes less time to f<strong>in</strong>d conflictsthan the w<strong>in</strong>dows method. Therefore, it is calledimproved w<strong>in</strong>dows method [11,12].Figure 5. Conflict matrix© 2010 ACADEMY PUBLISHER

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!