• English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • français 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Ouvrir une session
Voir le document 
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
  •   Accueil de DSpace
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Voir le document
JavaScript is disabled for your browser. Some features of this site may not work without it.
Tout DSpace
  • Communautés & Collections
  • Par date de publication
  • Auteurs
  • Titres
  • Sujets

In-Network Congestion Control for Multirate Multicast

Thumbnail
Auteur
Paschos G.S., Li C.-P., Modiano E., Choumas K., Korakis T.
Date
2016
Language
en
DOI
10.1109/TNET.2015.2503261
Sujet
Congestion control (communication)
Convergence of numerical methods
Electrical engineering
Software engineering
Throughput
Destination nodes
Important features
Maximize throughput
Multirate multicast
Network utility maximization
Novel control scheme
Prototype implementations
Transmission rates
Multicasting
Institute of Electrical and Electronics Engineers Inc.
Afficher la notice complète
Résumé
We present a novel control scheme that dynamically optimizes multirate multicast. By computing the differential backlog at every node, our scheme adaptively allocates transmission rates per session/user pair in order to maximize throughput. An important feature of the proposed scheme is that it does not require source cooperation or centralized calculations. This methodology leads to efficient and distributed algorithms that scale gracefully and can be embraced by low-cost wireless devices. Additionally, it is shown that maximization of sum utility is possible by the addition of a virtual queue at each destination node of the multicast groups. The virtual queue captures the desire of the individual user and helps in making the correct resource allocation to optimize total utility. Under the operation of the proposed schemes backlog sizes are deterministically bounded, which provides delay guarantees on delivered packets. To illustrate its practicality, we present a prototype implementation in the NITOS wireless testbed. The experimental results verify that the proposed schemes achieve maximum performance while maintaining low complexity. © 2016 IEEE.
URI
http://hdl.handle.net/11615/77959
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]
htmlmap 

 

Parcourir

Tout DSpaceCommunautés & CollectionsPar date de publicationAuteursTitresSujetsCette collectionPar date de publicationAuteursTitresSujets

Mon compte

Ouvrir une sessionS'inscrire
Help Contact
DepositionAboutHelpContactez-nous
Choose LanguageTout DSpace
EnglishΕλληνικά
htmlmap