THE RANDOM NEURAL NETWORK FOR COGNITIVE TRAFFIC ROUTING AND TASK ALLOCATION IN NETWORKS AND THE CLOUD

被引:0
|
作者
Wang, Lan [1 ]
机构
[1] Imperial Coll, Dept Elect & Elect Engn, London SW7 2BT, England
关键词
cloud computing; cognitive packet network; G-network; overlay network; random neural network; real-time application; reinforcement learning; routing; task allocation; REAL-TIME COMMUNICATION; PERFORMANCE; TRANSMISSION; SIMULATION; MANAGEMENT; QUALITY; SYSTEMS;
D O I
10.1017/S0269964817000183
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
G-Network queueing network models, and in particular the random neural network (RNN), are useful tools for decision making in complex systems, due to their ability to learn from measurements in real time, and in turn provide real-time decisions regarding resource and task allocation. In particular, the RNN has led to the design of the cognitive packet network (CPN) decision tool for the routing of packets in the Internet, and for task allocation in the Cloud. Thus in this paper, we present recent research on how to dynamically create the means for quality of service (QoS) to end users of the Internet and in the Cloud. The approach is based on adapting the decisions so as to benefit users as the conditions in the Internet and in Cloud servers vary due to changing traffic and workload. We present an overview of the algorithms that were designed based on the RNN, and also detail the experimental results that were obtained in three areas: (i) traffic routing for real-time applications, which have strict QoS constraints; (ii) routing approaches, which operate at the overlay level without affecting the Internet infrastructure; and (iii) the routing of tasks across servers in the Cloud through the Internet.
引用
收藏
页码:540 / 560
页数:21
相关论文
共 50 条
  • [1] The Random Neural Network and its Learning Process in Cognitive Packet Networks
    Liu, Peixiang
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 95 - 100
  • [2] Network Coding-aware Channel Allocation and Routing in Cognitive Radio Networks
    Shu, Zhihui
    Zhou, Jiazhen
    Yang, Yaoqing
    Sharif, Hamid
    Qian, Yi
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 5590 - 5595
  • [3] Survivable Task Allocation in Cloud Radio Access Networks With Mobile-Edge Computing
    Yang, Song
    He, Nan
    Li, Fan
    Trajanovski, Stojan
    Chen, Xu
    Wang, Yu
    Fu, Xiaoming
    IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (02) : 1095 - 1108
  • [4] Enhancing Cloud Resource Allocation with TrustFusionNet Using Random Forests and Convolutional Neural Networks
    Bharathi, S. T.
    Balasubramanian, C.
    Shanmugapriya, S.
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2025, 32 (01): : 116 - 122
  • [5] Traffic-aware optimal routing in software defined networks by predicting traffic using neural network
    Gunavathie, M. A.
    Umamaheswari, S.
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 239
  • [6] STATISTICAL ROUTING FOR COGNITIVE RANDOM ACCESS NETWORKS
    Dall'Anese, Emiliano
    Giannakis, Georgios B.
    2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 2957 - 2960
  • [7] PAINTER: Ingress Traffic Engineering and Routing for Enterprise Cloud Networks
    Koch, Thomas
    Yu, Shuyue
    Agarwal, Sharad
    Beckett, Ryan
    Katz-Bassett, Ethan
    PROCEEDINGS OF THE 2023 ACM SIGCOMM 2023 CONFERENCE, SIGCOMM 2023, 2023, : 360 - 377
  • [8] Task Allocation on Cloud Resources using Analytic Network Process
    Tripathi, Atul
    Vidyathi, Deo Prakash
    2015 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER ENGINEERING AND APPLICATIONS (ICACEA), 2015, : 971 - 978
  • [9] Energy efficient task allocation and consolidation in multicast cloud network
    Ashok Kumar Bhoi
    Manas Ranjan Kabat
    Suvendu Chandan Nayak
    G. Palai
    Wireless Networks, 2022, 28 : 3349 - 3366
  • [10] Energy efficient task allocation and consolidation in multicast cloud network
    Bhoi, Ashok Kumar
    Kabat, Manas Ranjan
    Nayak, Suvendu Chandan
    Palai, G.
    WIRELESS NETWORKS, 2022, 28 (8) : 3349 - 3366