Literature Database Entry

ayaz2011analysis


Serkan Ayaz, Felix Hoffmann, Reinhard German and Falko Dressler, "Analysis of Deficit Round Robin Scheduling for Future Aeronautical Data Link," Proceedings of 22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2011), Toronto, Canada, September 2011, pp. 1809-1814.

Abstract

The aviation community is currently working on the standardization of data communication systems for the future air traffic management. In this context, the International Civil Aviation Organization (ICAO) has initiated a work on standardization of an IPv6-based aeronautical telecommunications network and on future radio access technologies, respectively. In this paper, we integrate L-Band Digital Aeronautical Communications System Option 1 (L-DACS 1), which is one candidate for future radio access technologies, with realistic IPv6-based network layer functionality and analyze Deficit Round Robin (DRR) with fragmentation algorithm for the forward and return link in L-DACS 1. Our analysis mainly covers two application domains: file transfer and real-time services. We show that DRR with fragmentation scheduler provides good performance results in terms of throughput, delay, and bandwidth fairness.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Serkan Ayaz
Felix Hoffmann
Reinhard German
Falko Dressler

BibTeX reference

@inproceedings{ayaz2011analysis,
    author = {Ayaz, Serkan and Hoffmann, Felix and German, Reinhard and Dressler, Falko},
    title = {{Analysis of Deficit Round Robin Scheduling for Future Aeronautical Data Link}},
    booktitle = {22nd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2011)},
    pages = {1809-1814},
    year = {2011},
    month = {September},
    address = {Toronto, Canada},
    publisher = {IEEE},
    doi = {10.1109/PIMRC.2011.6139820},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.