Aproximación al modelamiento del enrutamiento en redes GMPLS con fines de optimización de recursos

Abstract

In this work basic concepts of GMPLS-based technology, with emphasis on routing, which is the exchange of information required before performing route calculation networks is reviewed. It takes into account that communications via the Internet, supported by the Internet Service Providers (ISP), daily show higher requirements, forcing the ISP to make efficient use of their resources while meeting the needs of their subscribers. GMPLS, is perhaps the most called to contribute for such purposes due to the separation of control plane and data and design appropriately oriented resource management protocols, however, the underlying communications complexities make the calculation Route an equally complex task due to various constraints imposed by these communications. Calculating restricted routes has led to extensive research on optimization, in order to achieve efficient algorithms. To carry out this work has been directed to look mathematical treatment of the problem of calculation of multiple best paths subject to multiple restrictions, the use of a set of algorithmic blocks is proposed and excels in them the importance of calculating the best K routes (KSP) from a graph. Speech elements mathematical algorithms adopted, implementations thereof is performed and evidence supporting operation performed occurs.