From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Book Chapter
Publisher : Lecture Notes in Computer Science
Source : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 7135 LNCS, Surathkal, p.444-450 (2012)
ISBN : 9783642292798
Keywords : Artificial intelligence, Blocking probability, CMS, Connection managements, Management systems, Performance bottlenecks, Processing speed, Processing time, reliable, Single point failure
Campus : Bengaluru
School : School of Engineering
Department : Electronics and Communication
Year : 2012
Abstract : The Centralized connection management method is vulnerable due to its single point failure and also it requires sufficient buffer and processing speed to handle the requests. To overcome this, we present an efficient and reliable centralized connection management scheme with two central management systems (CMS) for computer networks (ERCC). In ERCC, when a request comes, the odd-numbered requests will be taken up by CMS-1 and also stored in a queue of CMS-2 and vice-versa for the even-numbered requests. If the request-taken CMS cannot allocate a path, then the other CMS will automatically take it up after 't' seconds. It gives a second chance for failed requests. Furthermore, if any one of the CMS fails, other CMS will take over the entire work. By simulation, we showed that our proposed centralized connection management scheme has low blocking probability and processing time in comparison with the single CMS connection management scheme. © 2012 Springer-Verlag.
Cite this Research Publication : S. Kashyap, Shravan, I. V., Suman, A., Dr. T. K. Ramesh, and Vaya, P. R., “An Efficient and Reliable Centralized Connection Management Scheme for Computer Networks”, in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7135 LNCS, Surathkal: , 2012, pp. 444-450.