http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Scalable Path Computation Flooding Approach for PCE-Based Multi-domain Networks
Jordi Perelló,Guillem Hernández-Sola,Fernando Agraz,Salvatore Spadaro,Jaume Comellas 한국전자통신연구원 2010 ETRI Journal Vol.32 No.4
In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.
Cost-Efficient Virtual Optical Network Embedding for Manageable Inter-Data-Center Connectivity
Jordi Perelló,Pablo Pavón-Mariño,Salvatore Spadaro 한국전자통신연구원 2013 ETRI Journal Vol.35 No.1
Network virtualization opens the door to novel infrastructure services offering connectivity and node manageability. In this letter, we focus on the cost-efficient embedding of on-demand virtual optical network requests for interconnecting geographically distributed data centers. We present a mixed integer linear programming formulation that introduces flexibility in the virtual-physical node mapping to optimize the usage of the underlying physical resources. Illustrative results show that flexibility in the node mapping can reduce the number of add-drop ports required to serve the offered demands by 40%.