乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T20:25:40Z","timestamp":1694895940054},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,16]],"date-time":"2015-06-16T00:00:00Z","timestamp":1434412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10626-015-0213-2","type":"journal-article","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T02:59:33Z","timestamp":1434337173000},"page":"383-411","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Tight performance bounds in the worst-case analysis of feed-forward networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Anne","family":"Bouillard","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Thierry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"213_CR1","unstructured":"Andrews M (2007) Instability of FIFO in the permanent sessions model at arbitrarily small network loads. In: Proceeding of SODA\u201907"},{"key":"213_CR2","unstructured":"Baccelli F, Cohen G, Olsder GY, Quadrat JP (1992) Synchronization and linearity. Wiley"},{"key":"213_CR3","doi-asserted-by":"crossref","unstructured":"Bisti L, Lenzini L, Mingozzi E, Stea G (2008) Estimating the worst-case delay in FIFO tandems using network calculus. In: Proceeding of valuetools\u20192008","DOI":"10.4108\/ICST.VALUETOOLS2008.4388"},{"issue":"1","key":"213_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A Borodin","year":"2001","unstructured":"Borodin A, Kleinberg JM, Raghavan P, Sudan M, Williamson DP (2001) Adversarial queuing theory. J ACM 48(1):13\u201338","journal-title":"J ACM"},{"issue":"11-12","key":"213_CR5","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.peva.2008.04.008","volume":"65","author":"A Bouillard","year":"2008","unstructured":"Bouillard A, Gaujal B, Lagrange S, Thierry E (2008) Optimal routing for end-to-end guarantees using network calculus. Perform Eval 65(11-12):883\u2013906","journal-title":"Perform Eval"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Bouillard A, Jouhet L, Thierry E (2010) Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proceedings of infocom\u20192010","DOI":"10.1109\/INFCOM.2010.5461912"},{"issue":"1","key":"213_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10626-007-0028-x","volume":"18","author":"A Bouillard","year":"2008","unstructured":"Bouillard A, Thierry E (2008) An algorithmic toolbox for network calculus. Discret Event Dyn Syst 18(1):3\u201349","journal-title":"Discret Event Dyn Syst"},{"key":"213_CR8","unstructured":"Bouillard A, Junier A (2011) Worst-case delay bounds with fixed priorities using network calculus. In: Proceedings of valuetools\u201911"},{"key":"213_CR9","unstructured":"Boyer M, Fraboul C (2008) Tightening end to end delay upper bound for AFDX network calculus with rate latency FCFS servers using network calculus. In: Proceeding of WFCS\u20192008"},{"issue":"5","key":"213_CR10","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S1389-1286(02)00454-1","volume":"41","author":"S Chakraborty","year":"2003","unstructured":"Chakraborty S, K\u00fcnzli S, Thiele L, Herkersdorf A, Sagmeister P (2003) Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Comput Netw 41(5):641\u2013665","journal-title":"Comput Netw"},{"key":"213_CR11","doi-asserted-by":"crossref","unstructured":"Chang C-S (1997) A filtering theory for deterministic traffic regulation. In: Proceeding of INFOCOM\u201997, pp 436\u2013443","DOI":"10.1109\/INFCOM.1997.644492"},{"key":"213_CR12","doi-asserted-by":"crossref","unstructured":"Chang CS (2000) performance guarantees in communication networks, TNCS. Springer","DOI":"10.1007\/978-1-4471-0459-9"},{"issue":"1","key":"213_CR13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/18.61109","volume":"37","author":"RL Cruz","year":"1991","unstructured":"Cruz RL (1991) A calculus for network delay, part i: Network elements in isolation. IEEE Trans Inf Theory 37(1):114\u2013131","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"213_CR14","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/18.61110","volume":"37","author":"RL Cruz","year":"1991","unstructured":"Cruz RL (1991) A calculus for network delay, part ii: Network analysis. IEEE Trans Inf Theory 37(1):132\u2013141","journal-title":"IEEE Trans Inf Theory"},{"key":"213_CR15","doi-asserted-by":"crossref","unstructured":"Fidler M (2006) A network calculus approach to probabilistic quality of service analysis of fading channels. In: Proceeding of GLOBECOM\u20192006","DOI":"10.1109\/GLOCOM.2006.699"},{"issue":"9","key":"213_CR16","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/JPROC.2002.802002","volume":"90","author":"V Firoiu","year":"2002","unstructured":"Firoiu V, Le Boudec J-Y, Towsley D, Zhang Z-L (2002) Theories and models for internet quality of service. Proc IEEE 90(9):1565\u20131591","journal-title":"Proc IEEE"},{"key":"213_CR17","doi-asserted-by":"crossref","unstructured":"Hendriks M, Verhoef M (2006) Timed automata based analysis of embedded system architectures. In: Proceeding of IPDPS","DOI":"10.1109\/IPDPS.2006.1639422"},{"key":"213_CR18","unstructured":"Jiang Y, Liu Y (2008) Stochastic network calculus. Springer"},{"key":"213_CR19","unstructured":"Le Boudec J-Y, Thiran P (2004) Network calculus: A theory of deterministic queuing systems for the internet, volume LNCS 2050. revised version 4"},{"issue":"11-12","key":"213_CR20","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1016\/j.peva.2008.04.002","volume":"65","author":"L Lenzini","year":"2008","unstructured":"Lenzini L, Mingozzi E, Stea G (2008) A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems. Perform Eval 65(11-12):922\u2013943","journal-title":"Perform Eval"},{"issue":"1","key":"213_CR21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/dac.688","volume":"18","author":"S Martin","year":"2005","unstructured":"Martin S, Minet P, George L (2005) End-to-end response time with fixed priority scheduling: trajectory approach versus holistic approach. Int J Communication Systems 18(1):37\u201356","journal-title":"Int J Communication Systems"},{"key":"213_CR22","doi-asserted-by":"crossref","unstructured":"Perathoner S, Wandeler E, Thiele L, Hamann A, Schliecker S, Henia R, Racu R, Ernst R, Harbour M G (2007) Influence of different system abstractions on the performance analysis of distributed real-time systems. In: Proceeding of EMSOFT\u20192007","DOI":"10.1145\/1289927.1289959"},{"issue":"2","key":"213_CR23","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","volume":"23","author":"G Pruesse","year":"1994","unstructured":"Pruesse G, Ruskey F (1994) Generating linear extensions fast. SIAM J Comput 23(2):373\u2013386","journal-title":"SIAM J Comput"},{"key":"213_CR24","doi-asserted-by":"crossref","unstructured":"Rizzo G, Le Boudec J-Y (2008) Stability and delay bounds in heterogeneous networks of aggregate schedulers. In: Proceeding of INFOCOM\u20192008","DOI":"10.1109\/INFOCOM.2008.208"},{"issue":"1-4","key":"213_CR25","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.peva.2005.07.004","volume":"62","author":"G Rizzo","year":"2005","unstructured":"Rizzo G, Le Boudec J-Y (2005) \u201dpay bursts only once\u201d does not hold for non-FIFO guaranteed rate nodes. Perform Eval 62(1-4):366\u2013381","journal-title":"Perform Eval"},{"key":"213_CR26","doi-asserted-by":"crossref","unstructured":"Schmitt JB, Zdarsky FA (2006) The disco network calculator: A toolbox for worst case analysis. In: Proceeding of Valuetools\u20192006","DOI":"10.1145\/1190095.1190105"},{"key":"213_CR27","volume-title":"Delay bounds under arbitrary multiplexing","author":"JB Schmitt","year":"2007","unstructured":"Schmitt JB, Zdarsky FA, Fidler M (2007) Delay bounds under arbitrary multiplexing. University of Kaiserslautern, Technical report"},{"key":"213_CR28","doi-asserted-by":"crossref","unstructured":"Schmitt JB, Zdarsky FA, Fidler M (2008) Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch... In: Proceeding of INFOCOM\u20192008","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"213_CR29","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TII.2006.869934","volume":"2","author":"T Skeie","year":"2006","unstructured":"Skeie T, Johannessen S, Holmeide O (2006) Timeliness of real-time IP communication in switched industrial ethernet networks. IEEE Trans Ind Inform 2:25\u201339","journal-title":"IEEE Trans Ind Inform"},{"issue":"2","key":"213_CR30","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/90.490748","volume":"4","author":"L Tassiulas","year":"1996","unstructured":"Tassiulas L, Georgiadis L (1996) Any work-conserving policy stabilizes the ring with spatial re-use. IEEE\/ACM Trans Networking 4(2):205\u2013208","journal-title":"IEEE\/ACM Trans Networking"},{"key":"213_CR31","doi-asserted-by":"crossref","unstructured":"Thiele L, Chakraborty S, Gries M, Maxiaguine A, Greutert J (2001) Embedded software in network processors models and algorithms. In: Proceeding of EMSOFT\u20192001","DOI":"10.1007\/3-540-45449-7_29"},{"key":"213_CR32","doi-asserted-by":"crossref","unstructured":"Thiele L, Chakraborty S, Naedele M (2000) Real-time calculus for scheduling hard real-time systems. In: Proceeding of ISCAS\u20192000","DOI":"10.1109\/ISCAS.2000.858698"},{"issue":"2-3","key":"213_CR33","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0165-6074(94)90080-9","volume":"40","author":"K Tindell","year":"1994","unstructured":"Tindell K, Clark J (1994) Holistic schedulability analysis for distributed hard real-time systems. Microprocess Microprogram 40(2-3):117\u2013134","journal-title":"Microprocess Microprogram"},{"key":"213_CR34","unstructured":"Vanderbei RJ (2000) Linear programming, foundations and extensions. Kluwer Academic Publisher"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-015-0213-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-015-0213-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-015-0213-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T23:22:27Z","timestamp":1566861747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-015-0213-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,16]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s10626-015-0213-2","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,16]]}}}