{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:11:43Z","timestamp":1685351503582},"reference-count":0,"publisher":"National Library of Serbia","issue":"3","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2011]]},"abstract":"<jats:p>Network performance bounds, including the maximal end-toend (E2E) delay, the\n   maximal jitter and the maximal buffer backlog amount, are very important for\n   network QoS control, buffer management and network optimization. QoS-enhanced\n   To Next-hop Port Sequence Switch (QTNPOSS) is a recently proposed\n   transmission scheme to achieve scalable fast forwarding for multimedia\n   applications. However, the existing E2E delay bound of QTNPOSS network is not\n   tight. To this end, this paper presents a lower E2E delay bound for QTNPOSS\n   networks by using the network calculus theory, where the inherent properties\n   (e.g. packet length and peak rate) of the flow are taken into account.\n   Besides, the buffer size bound and the jitter bound of QTNPOSS network are\n   also presented. Moreover, by extensive numerical experiments, we discuss the\n   influences of the Long Range Dependence (LDR) traffic property and the\n   Weighted Fair Queuing (WFQ) weight on the proposed network performance\n   bounds. The results show that the WFQ weight influences the bounds more\n   greatly than the LRD property.<\/jats:p>","DOI":"10.2298\/csis101201033x","type":"journal-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T11:10:09Z","timestamp":1310037009000},"page":"890-908","source":"Crossref","is-referenced-by-count":0,"title":["Worst case performance bounds for multimedia flows in QoS-enhanced TNPOSS network"],"prefix":"10.2298","volume":"8","author":[{"given":"Ke","family":"Xiong","sequence":"first","affiliation":[{"name":"School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, P.R. China + Department of Electronic Engineering, Tsinghua University, Beijing, P.R. China"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, P.R. China"}]},{"given":"Shenghui","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, P.R. China"}]},{"given":"Zhifei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, P.R. China"}]},{"given":"Zhengding","family":"Qiu","sequence":"additional","affiliation":[{"name":"School of Computer Science & Information Technology, Beijing Jiaotong University, Beijing, P.R. China"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:18Z","timestamp":1685349018000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141100033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.2298\/csis101201033x","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}