• DocumentCode
    2927017
  • Title

    A coordination mechanism based on a combined technique applied to dynamic Packet scheduling in routers

  • Author

    Bourenane, Malika ; Mellouk, Abdelhamid ; Benhamamouch, Djillali

  • Author_Institution
    Comput. Sci. Dept., Univ. of Es-Senia, Oran, Algeria
  • fYear
    2009
  • fDate
    5-8 July 2009
  • Firstpage
    963
  • Lastpage
    969
  • Abstract
    This paper describes an approach which uses a machine learning model in a packet scheduling problem to improve the end-to-end delay. A good Packet scheduling discipline allows to achieve QoS differentiation and to optimize the queuing delay. In a dynamically changing environment this discipline should be also adaptive to the new traffic conditions. We model this problem as a multi-agent system which consists of a whole of autonomous learning agents that interact with the environment. We define the learning problem as a decentralized process using a general mathematical framework, namely Markovian Decision Processes which are an effective tool in the modelling of the decision-making in uncertain dynamic environments. Coordination between agents occurs through communication governed by an ant colony model.
  • Keywords
    learning (artificial intelligence); packet radio networks; quality of service; queueing theory; scheduling; telecommunication computing; Markovian decision processes; QoS; ant colony model; autonomous learning agents; coordination mechanism; decision-making; dynamic packet scheduling; end-to-end delay; machine learning model; multi-agent system; packet scheduling problem; routers; uncertain dynamic environments; Ant colony optimization; Control systems; Decision making; Delay; Jitter; Machine learning; Mathematical model; Multiagent systems; Scheduling algorithm; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 2009. ISCC 2009. IEEE Symposium on
  • Conference_Location
    Sousse
  • ISSN
    1530-1346
  • Print_ISBN
    978-1-4244-4672-8
  • Electronic_ISBN
    1530-1346
  • Type

    conf

  • DOI
    10.1109/ISCC.2009.5202351
  • Filename
    5202351