Gossip-Based Monitoring Protocol for 6G Networks

被引:4
|
作者
Femminella, Mauro [1 ,2 ]
Reali, Gianluca [1 ,2 ]
机构
[1] Univ Perugia, Dept Engn, I-06125 Perugia, Italy
[2] Consorzio Nazl Interuniv Telecomunicaz, I-43124 Parma, Italy
关键词
Protocols; Monitoring; 6G mobile communication; Peer-to-peer computing; Proposals; Cloud computing; Computer architecture; 6G; network signaling; network discovery; network monitoring; gossip protocol; COMMUNICATION; ARCHITECTURE; ALGORITHM;
D O I
10.1109/TNSM.2023.3263542
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The service function (SF) area has gained increasing attention in the last years due its ability to combine the advantages of cloud computing with network softwarization. By decoupling SFs from the physical equipment where they are executed, it is possible to make network services scalable and flexible. These advantages become even more evident in the forthcoming 6G networks, where the overall environment is expected to become more dynamic and cloud-based, with SFs deployed as cloud-native functions. However, in order to efficiently manage and compose services using these SFs, it is necessary to monitor the available resources of the nodes where they can be deployed, in addition to exchange information relevant to the operational status of active SFs. To this aim, we propose a lightweight monitoring architecture by using agents in charge of monitoring the status of SFs running in co-located clusters. These monitoring agents exchange their information by means of a gossip protocol, which allows increasing the reliability of the process. In this way, it is possible to keep service decisions as local as possible, limiting the interactions with centralized decision and orchestration platforms, and thus increasing network scalability and responsiveness. Performance evaluation shows the effectiveness of the proposed solution, and demonstrates that the network overhead of the distributed monitoring process is definitely affordable.
引用
收藏
页码:4126 / 4140
页数:15
相关论文
共 50 条
  • [31] Gossip-based service discovery in mobile ad hoc networks
    Lee, Choonhwa
    Helal, Sumi
    Lee, Wonjun
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2006, E89B (09) : 2621 - 2624
  • [32] A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
    Franceschelli, Mauro
    Giua, Alessandro
    Seatzu, Carla
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2010, 55 (05) : 1244 - 1249
  • [33] Gossip-based computer networking
    Kermarrec, Anne-Marie
    Van Steen, Maarten
    Operating Systems Review (ACM), 2007, 41 (05):
  • [34] Load balancing over heterogeneous networks with gossip-based algorithms
    Franceschelli, Mauro
    Giua, Alessandro
    Seatzu, Carla
    2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 1987 - 1993
  • [35] Gossip-based density estimation in dynamic heterogeneous sensor networks
    Malazi, Hadi Tabatabaee
    Zamanifar, Kamran
    Pruteanu, Andrei
    Dulman, Stefan
    2011 7TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2011, : 1365 - 1370
  • [36] Asynchronous Gossip-Based Random Projection Algorithms Over Networks
    Lee, Soomin
    Nedic, Angelia
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (04) : 953 - 968
  • [37] An experimental study on cheating and anti-cheating in gossip-based protocol
    Tang, Yun
    Zhang, Nan
    Shi, Yuanchun
    Yang, Shiqiang
    Zhong, Yuzhuo
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 1716 - 1721
  • [38] Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks
    Shamsaie, Abolhassan
    Fokkink, Wan
    Habibi, Jafar
    COMPUTER PERFORMANCE ENGINEERING, 2011, 6977 : 174 - +
  • [39] To Reach Consensus Using Uninorm Aggregation Operator: A Gossip-Based Protocol
    Huang, Zhixing
    Huang, Qiaoli
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2012, 27 (04) : 375 - 395
  • [40] Gossip-based protocol to reach consensus via uninorm aggregation operator
    Huang, Qiaoli
    Yin, Shiqun
    Huang, Zhixing
    ADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGS, 2008, 5036 : 319 - 330