On the scalability of network management information for inter-domain light-path assessment

被引:9
|
作者
Liu, GL [1 ]
Ji, CY
Chan, VWS
机构
[1] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
[2] MIT, Dept Elect Engn & Comp Sci, LIDS, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
Bayes rule; blocking probability; decision theory; light-path assessment; management information; scalability;
D O I
10.1109/TNET.2004.842436
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate the necessary amount of network management information for light-path assessment to dynamically set up end-to-end light-paths across administrative domains in optical networks. Our focus is on the scalability of partial management information. We pose light-path assessment as a decision problem, and define the performance as the Bayes probability of an erroneous decision. We then characterize the scalability of management information as its growth rate with respect to the total resources of the network to achieve a desired performance. Scalability is achieved if the management information needed is only a negligible fraction of the total network resources. Specifically, we consider in this work one type of partial information that grows only logarithmically with the number of wavelengths supported per link. We derive an upper bound for the Bayes error in terms of the blocking probability when a new call is presented at the entrance of the network. We evaluate the upper bound using both independent and dependent models of wavelength usage for intra- and inter-domain calls. Our study shows that there exists a "threshold effect": The Bayes error decreases to zero exponentially with respect to the load when the load is either below or above a threshold value; and is nonnegligible when the load is in a small duration around the threshold. This suggests that the partial information considered can indeed provide the desired performance, and a small percentage of erroneous decisions can be traded off to achieve a large saving in the amount of management information.
引用
收藏
页码:160 / 172
页数:13
相关论文
共 50 条
  • [31] A new path probing strategy for inter-domain multicast routing
    Costa, A
    Nicolau, MJ
    Santos, A
    Freitas, V
    2005 NEXT GENERATION INTERNET NETWORKS, 2005, : 9 - 15
  • [32] Path-Preserving Anonymization for Inter-domain Routing Policies
    Shao, Xiaozhe
    Pishro-Nik, Hossein
    Gao, Lixin
    RISKS AND SECURITY OF INTERNET AND SYSTEMS (CRISIS 2021), 2022, 13204 : 121 - 136
  • [33] QoS State Information Aggregation for Inter-domain Routing
    Xiong, Ke
    Qiu, Zheng-ding
    Zhang, Hong-ke
    ICSP: 2008 9TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-5, PROCEEDINGS, 2008, : 1998 - +
  • [34] An evaluation for PCE selection schemes for inter-domain path computation
    Saad, Tarek
    Israr, Junaid
    Sivabalan, Siva
    Mouftah, Hussein T.
    ICTON 2007: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 3, 2007, : 187 - 187
  • [35] On Path Selection and Wavelength Assignment in Inter-Domain Lightpath Provisioning
    Pontes, Alisson S. L.
    da Fonseca, Nelson L. S.
    Drummond, Andre C.
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 1568 - 1573
  • [36] Bandwidth Constrained Distributed Inter-domain Path Selection (DIPS)
    Meng, Rui
    Da, Bin
    Chen, Zhe
    Wang, Chuang
    Jiang, Sheng
    2018 14TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM), 2018, : 391 - 394
  • [37] Application of an improved D-S theory algorithm for stable inter-domain path selection in a network security management system
    Rongli, Chen, 1600, TeknoScienze, Viale Brianza,22, Milano, 20127, Italy (28):
  • [38] Inter-Domain Redundancy Path Computation Methods Based on PCE
    Hayashi, Rie
    Oki, Eiji
    Shiomoto, Kohei
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2008, E91B (10) : 3185 - 3193
  • [39] Application of Logarithmic Keying for securing AS - PATH in Inter-Domain Routing
    Vidya, K.
    Uthariaraj, Rhymend, V
    FIRST INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING 2009 (ICAC 2009), 2009, : 86 - +
  • [40] Proxy cryptography for secure inter-domain information exchanges
    Peng, SG
    Han, Z
    11th Pacific Rim International Symposium on Dependable Computing, Proceedings, 2005, : 193 - 199