Analysis of EPONs under the static priority scheduling scheme with fixed transmission times

被引:14
|
作者
Holmberg, Torgny [1 ]
机构
[1] Tech Univ Denmark, Res Ctr COM, DK-2800 Lyngby, Denmark
来源
2006 2nd Conference on Next Generation Internet Design and Engineering | 2006年
关键词
D O I
10.1109/NGI.2006.1678241
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we analyse the Ethernet Passive Optical Network (EPON) and formulate dimensioning problems. Under the assumption that the transmission times are fixed in duration and that the input traffic is rate limited and scheduled by the Static Priority scheme, we provide means for dimensioning the network in order to keep the required hard deadlines. Expressions of the frame delay are derived as functions of the arrival curves of the different traffic sources. Furthermore, the arrival regulator structure is general and the only requirements are that the arrival process is causal and that the regulator provides sub-additivity. In this study, we find that the examined structure is highly inefficient with poor utilisation and where the deadlines basically is provided by means of overdimensioning. The static structure of the bandwidth allocation scheme allows no adjustment of the current traffic load and must therefore proactively allocate resources yielding a rigid and inefficient network.
引用
收藏
页码:192 / 199
页数:8
相关论文
共 50 条
  • [21] A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications
    Lonn, H
    Axelsson, J
    PROCEEDINGS OF THE 11TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 1999, : 142 - 149
  • [22] A faster exact schedulability analysis for fixed-priority scheduling
    Lu, Wan-Chen
    Hsieh, Jen-Wei
    Shih, Wei-Kuan
    Kuo, Tei-Wei
    JOURNAL OF SYSTEMS AND SOFTWARE, 2006, 79 (12) : 1744 - 1753
  • [23] Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds
    Rivera-Verduzco, Hector J.
    Bril, Reinder J.
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2017), 2017, : 307 - 317
  • [24] Schedulability Analysis for Real-Time P-FRP Tasks Under Fixed Priority Scheduling
    Jiang, Yu
    Cheng, Albert M. K.
    Zou, Xingliang
    2015 IEEE 21ST INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, 2015, : 31 - 40
  • [25] Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling
    Seol, Ye-In
    Kim, Young-Kuk
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [26] Efficient algorithms for schedulability analysis and priority assignment for fixed-priority preemptive scheduling with offsets
    Gu, Zonghua
    Cai, Haibin
    INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2014, 6 (04) : 303 - 318
  • [27] Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors
    Andersson, Bjoern
    Tovar, Eduardo
    13TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2007, : 111 - +
  • [28] Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
    Balbastre, Patricia
    Ripoll, Ismael
    Crespo, Alfons
    2009 15TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2009, : 315 - 320
  • [29] Schedulability Analysis on Generalized Quantum-Based Fixed Priority Scheduling
    Park, Moonju
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2009, E92D (02): : 332 - 335
  • [30] Analysis of Deadline Miss Rates for Uniprocessor Fixed-Priority Scheduling
    Chen, Kuan-Hsun
    von der Brueggen, Georg
    Chen, Jian-Jia
    2018 IEEE 24TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA), 2018, : 168 - 178