By Topic

Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. I. Papadimitriou ; Computer Technol. Inst., Patras, Greece ; D. G. Maritsas

The increasing bandwidth demands of the emerging new generation of computer communication networks have led to the utilization of optical fiber as a transmission medium. A new receiver conflict avoidance algorithm for wavelength-division multiplexing (WDM) broadcast-and-select star networks is introduced. The proposed algorithm is based on the use of learning automata in order to reduce the number of receiver conflicts and, consequently, improve the performance of the network. According to the proposed scheme, each node of the network is provided with a learning automaton; the learning automaton decides which of the packets waiting for transmission will be transmitted at the beginning of the next time slot. The asymptotic behavior of the system, which consists of the automata and the network, is analyzed and it is proved that the probability of choosing each packet asymptotically tends to be proportional to the probability that no receiver conflict will appear at the destination node of this packet. Furthermore, extensive simulation results are presented, which indicate that significant performance improvement is achieved when the proposed algorithm is applied on the basic DT-WDMA protocol

Published in:

IEEE/ACM Transactions on Networking  (Volume:4 ,  Issue: 3 )