Logo
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Institutional repository
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

Multirate multicast: Optimal algorithms and implementation

Thumbnail
Author
Paschos, G. S.; Li, C. P.; Modiano, E.; Choumas, K.; Korakis, T.
Date
2014
DOI
10.1109/INFOCOM.2014.6847956
Keyword
Algorithms
Scheduling
Device capabilities
Multirate multicast
Network congestions
Network optimization
Network throughput
Network utility maximization
Novel control scheme
Prototype implementations
Complex networks
Metadata display
Abstract
Multirate multicast improves user quality but complicates network optimization. This paper introduces a novel control scheme to dynamically optimize multirate multicast. We present MMT, an adaptive policy which combines differential backlog scheduling and intelligent packet dropping, both based on local information. MMT is shown to maximize network throughput by adapting to changing conditions such as channel quality, network congestion, and device capabilities. Then, we study the problem of per-receiver network utility maximization. To maximize sum utility we propose the MMU policy, an extension of MMT with receiver-end flow control. Under the operation of both policies backlog sizes are deterministically bounded, which provides delay guarantees on delivered packets. An important feature of the proposed scheme is that it does not require source cooperation or centralized calculations. To illustrate its practicality, we present a prototype implementation in the NITOS wireless testbed. Experimental results verify the optimality of the scheme and its low complexity. © 2014 IEEE.
URI
http://hdl.handle.net/11615/32074
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19735]

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    CONTENT project: Considerations towards a cloud-based internetworking paradigm 

    Katsalis, K.; Korakis, T.; Landi, G.; Bernini, G.; Rofoee, B. R.; Peng, S.; Anastasopoulos, M.; Tzanakaki, A.; Christofi, D.; Georgiades, M.; Larsen, R.; Riera, J. F.; Escalona, E.; Garcia-Espin, J. A. (2013)
    Although cloud computing and the Software Defined Network (SDN) framework are fundamentally changing the way we think about network services, multi-domain and multitechnology problems are not sufficiently investigated. ...
  • Thumbnail

    Backbone formation in military multi-layer ad hoc networks using complex network concepts 

    Papakostas D., Basaras P., Katsaros D., Tassiulas L. (2016)
    Modern battlefields are characterized by increasing deployment of ad hoc communications among allied entities. These networks can be seen as a complex multi-layer ad hoc network, where each layer may be an independently ...
  • Thumbnail

    Query sensitive storage for wireless sensor networks 

    Papadimitriou, A.; Katsaros, D.; Manolopoulos, Y. (2009)
    Storage management in wireless sensor networks is an area that has started to attract significant attention, and several methods have been proposed, such as Local Storage (LS), Data-Centric Storage (DCS) and more recently ...
htmlmap 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
htmlmap