메뉴 건너뛰기




Volumn 48, Issue 5, 2012, Pages 527-569

Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks

Author keywords

Delay bounds; FIFO; Network Calculus; Numerical analysis

Indexed keywords

APPROXIMATE SOLUTION; CLOSED FORM; COMPUTATION COSTS; DELAY BOUND; END-TO-END DELAY BOUNDS; FIFO; LOWER AND UPPER BOUNDS; LOWER BOUNDS; NETWORK CALCULUS; NETWORK NODE; NUMERICAL SOLUTION METHOD; TANDEM NETWORKS; TRAFFIC FLOW;

EID: 84865346531     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-012-9153-1     Document Type: Article
Times cited : (17)

References (24)
  • 2
    • 78149466757 scopus 로고    scopus 로고
    • Improving the worst-case delay analysis of an afdx network using an optimized trajectory approach
    • Bauer H, Scharbarg J-L, Fraboul C (2010) Improving the worst-case delay analysis of an AFDX network using an optimized trajectory approach. IEEE Trans Ind Inform 6(4):521-533
    • (2010) IEEE Trans Ind Inform , vol.6 , Issue.4 , pp. 521-533
    • Bauer, H.1    Scharbarg, J.-L.2    Fraboul, C.3
  • 3
    • 78650298703 scopus 로고    scopus 로고
    • Deborah: A tool for worst-case analysis of fifo tandems
    • Crete, Oct 18-20, 2010
    • Bisti L, Lenzini L, Mingozzi E, Stea G (2010) DEBORAH: a tool for worst-case analysis of FIFO tandems. In: ISoLA 2010, Crete, Oct 18-20, 2010
    • (2010) ISoLA 2010
    • Bisti, L.1    Lenzini, L.2    Mingozzi, E.3    Stea, G.4
  • 4
    • 84896990648 scopus 로고    scopus 로고
    • Estimating the worst-case delay in fifo tandems using network calculus
    • Athens, Greece, 21-23 October, 2008
    • Bisti L, Lenzini L, Mingozzi E, Stea G (2008) Estimating the worst-case delay in FIFO tandems using network calculus. In: Proc of VALUETOOLS 2008, Athens, Greece, 21-23 October, 2008
    • (2008) Proc of VALUETOOLS 2008
    • Bisti, L.1    Lenzini, L.2    Mingozzi, E.3    Stea, G.4
  • 7
    • 77953309822 scopus 로고    scopus 로고
    • Tight performance bounds in the worst-case analysis of feedforward networks
    • S. Diego, CA, 14-19 March, 2010
    • Bouillard A, Jouhet L, Thierry E (2010) Tight performance bounds in the worst-case analysis of feedforward networks. In: Proc of INFOCOM 2010, S. Diego, CA, 14-19 March, 2010
    • (2010) Proc of INFOCOM 2010
    • Bouillard, A.1    Jouhet, L.2    Thierry, E.3
  • 8
    • 84865324317 scopus 로고    scopus 로고
    • The pegase project: Precise and scalable analysis for aerospace communication systems with network calculus
    • Crete, October 18-20, 2010
    • Boyer M, Navet N, Olive X, Thierry E (2010) The Pegase project: precise and scalable analysis for aerospace communication systems with Network Calculus. In: Proc of ISoLA 2010, Crete, October 18-20, 2010
    • (2010) Proc of ISoLA 2010
    • Boyer, M.1    Navet, N.2    Olive, X.3    Thierry, E.4
  • 9
    • 0003209840 scopus 로고
    • Integrated services in the internet architecture: An overview
    • Braden R, Clark D, Shenker S (1994) Integrated services in the Internet architecture: an overview. IETF RFC 1633
    • (1994) IETF RFC 1633
    • Braden, R.1    Clark, D.2    Shenker, S.3
  • 10
    • 0037420692 scopus 로고    scopus 로고
    • Performance evaluation of network processor architectures: Combining simulation with analytical estimation
    • Chakraborty S, Künzli S, Thiele L, Herkersdorf A, Sagmeister P (2003) Performance evaluation of network processor architectures: combining simulation with analytical estimation. Comput Netw 42(5):641- 665
    • (2003) Comput Netw , vol.42 , Issue.5 , pp. 641-665
    • Chakraborty, S.1    Künzli, S.2    Thiele, L.3    Herkersdorf, A.4    Sagmeister, P.5
  • 11
    • 84865339814 scopus 로고    scopus 로고
    • Performance guarantees in communication networks. Springer, new york cruz rl (1991) a calculus for network delay
    • Chang CS (2000) Performance guarantees in communication networks. Springer, New York Cruz RL (1991) A calculus for network delay. IEEE Trans Inf Theory 37(1):114-141
    • (2000) IEEE Trans Inf Theory , vol.37 , Issue.1 , pp. 114-141
    • Chang, C.S.1
  • 12
    • 0022162277 scopus 로고    scopus 로고
    • A simplex algorithm for piecewise-linear programming i: Derivation and proof
    • doi:10.1007/BF01582246
    • Fourer R (2010) A simplex algorithm for piecewise-linear programming I: derivation and proof. Math Program 33(2):204-233. doi:10.1007/BF01582246
    • (2010) Math Program , vol.33 , Issue.2 , pp. 204-233
    • Fourer, R.1
  • 13
    • 78650293633 scopus 로고    scopus 로고
    • Searching for tight performance bounds in feed-forward networks
    • Kiefer A, Gollan N, Schmitt JB (2010) Searching for tight performance bounds in feed-forward networks. In: Proc of MMB/DFT, pp 227-241
    • (2010) Proc of MMB/DFT , pp. 227-241
    • Kiefer, A.1    Gollan, N.2    Schmitt, J.B.3
  • 14
    • 35348893986 scopus 로고    scopus 로고
    • Modeling and worst-case dimensioning of cluster-tree wireless sensor networks
    • DOI 10.1109/RTSS.2006.29, 4032368, Proceedings of 27th IEEE International Real-Time Systems Symposium, RTSS 2006
    • Koubaa A, Alves M, Tovar E (2006) Modeling and worst-case dimensioning of cluster-tree wireless sensor networks. In: Proc of IEEE RTSS'06, pp 412-421 (Pubitemid 351209750)
    • (2006) Proceedings - Real-Time Systems Symposium , pp. 412-421
    • Koubaa, A.1    Alves, M.2    Tovar, E.3
  • 15
    • 0003371176 scopus 로고    scopus 로고
    • Network calculus
    • Springer, Berlin
    • Le Boudec J-Y, Thiran P (2001) Network Calculus. LNCS, vol 2050. Springer, Berlin
    • (2001) LNCS , vol.2050
    • Le Boudec, J.-Y.1    Thiran, P.2
  • 16
    • 33745851161 scopus 로고    scopus 로고
    • Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
    • DOI 10.1016/j.peva.2005.10.003, PII S0166531605001537
    • Lenzini L, Martorini L, Mingozzi E, Stea G (2006) Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks. Perform Eval 63:956-987 (Pubitemid 44037830)
    • (2006) Performance Evaluation , vol.63 , Issue.9-10 , pp. 956-987
    • Lenzini, L.1    Martorini, L.2    Mingozzi, E.3    Stea, G.4
  • 17
    • 53449093224 scopus 로고    scopus 로고
    • A methodology for computing end-to-end delay bounds in fifomultiplexing tandems
    • Lenzini L, Mingozzi E, Stea G (2008) A methodology for computing end-to-end delay bounds in FIFOmultiplexing tandems. Perform Eval 65:922-943
    • (2008) Perform Eval , vol.65 , pp. 922-943
    • Lenzini, L.1    Mingozzi, E.2    Stea, G.3
  • 18
    • 13544275563 scopus 로고    scopus 로고
    • Delay bounds for FIFO aggregates: A case study
    • DOI 10.1016/j.comcom.2004.10.003, PII S0140366404003652
    • Lenzini L, Mingozzi E, Stea G (2005) Delay bounds for FIFO aggregates: a case study. Comput Commun 28(3):287-299 (Pubitemid 40219939)
    • (2005) Computer Communications , vol.28 , Issue.3 , pp. 287-299
    • Lenzini, L.1    Mingozzi, E.2    Stea, G.3
  • 19
    • 33847156061 scopus 로고    scopus 로고
    • Schedulability analysis of flows scheduled with fifo: Application to the expedited forwarding class
    • Rhodes Island, 25-29 April, 2006
    • Martin S, Minet P (2006) Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class. In: Proc of IPDPS 2006, Rhodes Island, 25-29 April, 2006
    • (2006) Proc of IPDPS 2006
    • Martin, S.1    Minet, P.2
  • 20
    • 35048879318 scopus 로고    scopus 로고
    • Deterministic end-to-end guarantees for real-time applications in a diffserv-mpls domain
    • Springer, Berlin
    • Martin S, Minet P, George L (2004) Deterministic end-to-end guarantees for real-time applications in a DiffServ-MPLS domain. In: Proc of SERA 2003. LNCS, vol 3026. Springer, Berlin, pp 51-73
    • (2004) Proc of SERA 2003. LNCS , vol.3026 , pp. 51-73
    • Martin, S.1    Minet, P.2    George, L.3
  • 21
    • 26444502124 scopus 로고    scopus 로고
    • Sensor network calculus - A framework for worst case analysis
    • Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005. Proceedings
    • Schmitt JB, Roedig U (2005) Sensor Network Calculus - a framework for worst case analysis. In: DCOSS'05, pp 141-154, June 2005 (Pubitemid 41425114)
    • (2005) Lecture Notes in Computer Science , vol.3560 , pp. 141-154
    • Schmitt, J.B.1    Roedig, U.2
  • 22
    • 51449102715 scopus 로고    scopus 로고
    • Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch
    • Schmitt JB, Zdarsky FA, Fidler M (2008) Delay bounds under arbitrary multiplexing: when Network Calculus leaves you in the lurch. In: Proc of INFOCOM 2008, pp 1669-1677
    • (2008) Proc of INFOCOM 2008 , pp. 1669-1677
    • Schmitt, J.B.1    Zdarsky, F.A.2    Fidler, M.3
  • 23
    • 33645672593 scopus 로고    scopus 로고
    • Timeliness of real-time ip communication in switched industrial ethernet networks
    • Skeie T, Johannessen S, Holmeide O (2006) Timeliness of real-time IP communication in switched industrial Ethernet networks. IEEE Trans Ind Inform 2:25-39
    • (2006) IEEE Trans Ind Inform , vol.2 , pp. 25-39
    • Skeie, T.1    Johannessen, S.2    Holmeide, O.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.