To investigate a new ant-based agent algorithm for providing survivable routing in WDM network. The major problem in survivable routing WDM network is routing wavelength and assignment (RWA) problem, It sets up light path by routing and assigning a wavelength to each connection such that no light path use the same wavelength on same link Initially, in the path, a major part of the bandwidth is allocated for primary path and this part can not be shared by other paths. Fraction of the bandwidth is allocated for backup path and this can be shared by other disjoint paths. The disjoint path can be primary or backup path. The residual bandwidth is used for future primary and backup paths computations. When the connection request arrives to the source, it looks in its pheromone and load table and send connection request (CNREQ) message to the destination along with feasibility and load values of paths. Upon receiving the CNREQ, the path that has higher feasibility value and the load value lesser than ThLOAD can be selected by the destination for further processing. Using NS-2 simualtion we show that the proposed ant based routing achives better channel utilization and throughput
"synopsis" may belong to another edition of this title.
M.Rangaswamy recieved B.Tech(ECE)and M.Tech(Digital Electronics and Communication Systems)from J.N.T.University,Anantapur,India.He has published extensively in optical networking,with publications andmultiple patents in research area of communications.
"About this title" may belong to another edition of this title.
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - To investigate a new ant-based agent algorithm for providing survivable routing in WDM network. The major problem in survivable routing WDM network is routing wavelength and assignment (RWA) problem, It sets up light path by routing and assigning a wavelength to each connection such that no light path use the same wavelength on same link Initially, in the path, a major part of the bandwidth is allocated for primary path and this part can not be shared by other paths. Fraction of the bandwidth is allocated for backup path and this can be shared by other disjoint paths. The disjoint path can be primary or backup path. The residual bandwidth is used for future primary and backup paths computations. When the connection request arrives to the source, it looks in its pheromone and load table and send connection request (CNREQ) message to the destination along with feasibility and load values of paths. Upon receiving the CNREQ, the path that has higher feasibility value and the load value lesser than ThLOAD can be selected by the destination for further processing. Using NS-2 simualtion we show that the proposed ant based routing achives better channel utilization and throughput. Seller Inventory # 9783659278167
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Swamy M. RangaM.Rangaswamy recieved B.Tech(ECE)and M.Tech(Digital Electronics and Communication Systems)from J.N.T.University,Anantapur,India.He has published extensively in optical networking,with publications andmultiple patents in. Seller Inventory # 5145180
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 84 pages. 8.66x5.91x0.19 inches. In Stock. Seller Inventory # 3659278165
Quantity: 1 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -To investigate a new ant-based agent algorithm for providing survivable routing in WDM network. The major problem in survivable routing WDM network is routing wavelength and assignment (RWA) problem, It sets up light path by routing and assigning a wavelength to each connection such that no light path use the same wavelength on same link Initially, in the path, a major part of the bandwidth is allocated for primary path and this part can not be shared by other paths. Fraction of the bandwidth is allocated for backup path and this can be shared by other disjoint paths. The disjoint path can be primary or backup path. The residual bandwidth is used for future primary and backup paths computations. When the connection request arrives to the source, it looks in its pheromone and load table and send connection request (CNREQ) message to the destination along with feasibility and load values of paths. Upon receiving the CNREQ, the path that has higher feasibility value and the load value lesser than ThLOAD can be selected by the destination for further processing. Using NS-2 simualtion we show that the proposed ant based routing achives better channel utilization and throughputVDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch. Seller Inventory # 9783659278167
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Congestion detection in WDM Networks | Primary & Backup path Computations | M. Ranga Swamy (u. a.) | Taschenbuch | 84 S. | Englisch | 2012 | LAP LAMBERT Academic Publishing | EAN 9783659278167 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 106203801