Merging existing network nodes into a new combined node

In order to improve network services and lower the cost of them, there are attempts to enable communication nodes to perform various roles. To add more functionality and roles to communication nodes, existing communication nodes should be replaced with new ones, which lead to burdensome initial cost to service providers. Therefore, it is required a method of enabling existing communication nodes to perform a new function as well as exiting functions without introducing new communication nodes. In this paper, we propose a method for integrating the existing multiple communicating nodes into one combined node. It is shown that multiple networking nodes operate as a combined node by connecting them physically and logically, assigning specialized roles to them, and making them share common control data. With intent to explain the advantages of the combined node, we estimate and compare the resource requirements for a combined node and its corresponding separate nodes. Taken as a whole, a considerable amount of node resources can be saved in the combined node due to resource sharing among the component nodes. The resulting surplus resources after merging existing network nodes into a new combined node can be used as a basis for the expansion of existing services and the introduction of new network services.

[1]  Károly Farkas OMP Simulation Results in IP Networks 1 , 2001 .

[2]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[3]  David Meyer,et al.  BGP-4 Protocol Analysis , 2006, RFC.

[4]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[5]  B. Jaumard,et al.  A distributed and scalable RSVP-TE architecture for next generation IP routers , 2009, 2009 International Conference on High Performance Switching and Routing.

[6]  Chen-Nee Chuah,et al.  Impact of BGP Dynamics on Router CPU Utilization , 2004, PAM.

[7]  João Pedro Hespanha,et al.  Hierarchical max-flow routing , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[8]  Eduardo Grampín,et al.  Cooperation of control and management plane for provisioning in MPLS networks , 2005, 2005 9th IFIP/IEEE International Symposium on Integrated Network Management, 2005. IM 2005..

[9]  Kamalrulnizam Abu Bakar,et al.  Scheduling of OSPF routing table calculation using Generalized Regression Neural Network , 2011, 2011 17th IEEE International Conference on Networks.

[10]  B. Cousin,et al.  Improved MPLS-TE LSP Path Computation using Preemption , 2007, 2007 First International Global Information Infrastructure Symposium.

[11]  Tae-Whan Yoo,et al.  Performance Evaluation of Service-Aware Optical Transport System , 2010 .

[12]  Károly Farkas OMP Simulation Results in IP Networks , 2001 .

[13]  Soon-Seok Lee,et al.  Multicore Flow Processor with Wire‐Speed Flow Admission Control , 2012 .

[14]  John Moy,et al.  OSPF Protocol Analysis , 1991, RFC.

[15]  Deepinder P. Sidhu,et al.  Comparative analysis of path computation techniques for MPLS traffic engineering , 2002, Comput. Networks.

[16]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..