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
关键词
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 条
  • [1] Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points
    Yao, Gang
    Buttazzo, Giorgio
    Bertogna, Marko
    16TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2010), 2010, : 71 - 80
  • [2] Resource Hold Times under Multiprocessor Static-Priority Global Scheduling
    Nemati, Farhang
    Nolte, Thomas
    2011 IEEE 17TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA 2011), VOL 1, 2011, : 197 - 206
  • [3] Feasibility analysis under fixed priority scheduling with limited preemptions
    Yao, Gang
    Buttazzo, Giorgio
    Bertogna, Marko
    REAL-TIME SYSTEMS, 2011, 47 (03) : 198 - 223
  • [4] Feasibility analysis under fixed priority scheduling with limited preemptions
    Gang Yao
    Giorgio Buttazzo
    Marko Bertogna
    Real-Time Systems, 2011, 47 : 198 - 223
  • [5] Delay analysis for CBR traffic under static-priority scheduling
    Iida, K
    Takine, T
    Sunahara, H
    Oie, Y
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (02) : 177 - 185
  • [6] Schedulability analysis for linear transactions under fixed priority hybrid scheduling
    Gao, Zhi-gang
    Wu, Zhao-hui
    JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2008, 9 (06): : 776 - 785
  • [7] Schedulability analysis for linear transactions under fixed priority hybrid scheduling
    Zhi-gang Gao
    Zhao-hui Wu
    Journal of Zhejiang University-SCIENCE A, 2008, 9 : 776 - 785
  • [9] Response Time Analysis for Hybrid Task Sets under Fixed Priority Scheduling
    Zhou, Quan
    Huang, Jihua
    Li, Jianjun
    Li, Zhi
    2022 IEEE 28TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS), 2022, : 108 - 120
  • [10] Analysis of hierarchical fixed-priority scheduling
    Saewong, S
    Rajkumar, R
    Lehoczky, JP
    Klein, MH
    EUROMICRO RTS 2002: 14TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2002, : 173 - 181