{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:01:38Z","timestamp":1648821698471},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T00:00:00Z","timestamp":1383177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s11277-013-1476-2","type":"journal-article","created":{"date-parts":[[2013,10,31]],"date-time":"2013-10-31T00:33:26Z","timestamp":1383179606000},"page":"2449-2466","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of BSCFQ: A Modified Version of SCFQ to Support Bursty Traffic"],"prefix":"10.1007","volume":"75","author":[{"given":"Mahmoud","family":"Daneshvar\u00a0Farzanegan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Saidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Mahdavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,31]]},"reference":[{"key":"1476_CR1","doi-asserted-by":"crossref","unstructured":"Daneshvar, M. F., Saidi, H., & Mahdavi, M. (April 2013). Improving SCFQ to support bursty traffic. International Journal of Wireless & Mobile Networks (IJWMN), 5(2), 21\u201331.","DOI":"10.5121\/ijwmn.2013.5202"},{"issue":"2","key":"1476_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/90.664266","volume":"6","author":"D Stiliadis","year":"1998","unstructured":"Stiliadis, D., & Varma, A. (1998). Rate-proportional servers: A design methodology for fair queueing algorithms. IEEE\/ACM Transactions on Networking, 6(2), 175\u2013185.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1476_CR3","doi-asserted-by":"crossref","unstructured":"Annadurai, C. (February 2011). Review of packet scheduling algorithms in mobile AdHoc networks. International Journal of Computer Applications, 15(1), 7\u201310.","DOI":"10.5120\/1914-2552"},{"key":"1476_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, H., & Keshav, S. (1991). Comparison of rate-based service disciplines. In Proceedings of the ACM conference on communications architecture & protocols, pp. 113\u2013121.","DOI":"10.1145\/115992.116004"},{"issue":"4","key":"1476_CR5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/90.649514","volume":"5","author":"P Goyal","year":"1997","unstructured":"Goyal, P., & Vin, H. (1997). Generalized guaranteed rate scheduling algorithms: A framework. IEEE\/ACM Transaction on Networking, 5(4), 561\u2013571.","journal-title":"IEEE\/ACM Transaction on Networking"},{"issue":"5","key":"1476_CR6","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/90.731196","volume":"6","author":"D Stiliadis","year":"1998","unstructured":"Stiliadis, D., & Varma, A. (1998). Latency-Rate servers: A general model for analysis of traffic scheduling algorithms. IEEE\/ACM Transactions on Networking (ToN), 6(5), 611\u2013624.","journal-title":"IEEE\/ACM Transactions on Networking (ToN)"},{"key":"1476_CR7","doi-asserted-by":"crossref","first-page":"2392","DOI":"10.1016\/j.comnet.2011.04.004","volume":"55","author":"Z Dwekat","year":"2011","unstructured":"Dwekat, Z., & Rouskas, G. N. (2011). A practical fair queuing scheduler: Simplification through quantization. Computer Networks, 55, 2392\u20132406.","journal-title":"Computer Networks"},{"key":"1476_CR8","doi-asserted-by":"crossref","unstructured":"Kalle, R., Devi, U. C., & Kalyanaraman, S. (2011). Multi-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows. In Proceedings of IEEE international workshop on quality of service (IWQoS), pp. 1\u20139.","DOI":"10.1109\/IWQOS.2011.5931315"},{"issue":"4","key":"1476_CR9","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.compeleceng.2008.11.006","volume":"36","author":"F Sbrina","year":"2010","unstructured":"Sbrina, F. (2010). A novel resource scheduling algorithm for QoS-aware services on the Internet. Journal of Computer and Electrical Engineering, 36(4), 718\u2013734.","journal-title":"Journal of Computer and Electrical Engineering"},{"key":"1476_CR10","doi-asserted-by":"crossref","unstructured":"Golestani, S. (1994). A self-clocked fair queueing scheme for broadband applications. In Proceedings of INFOCOM, pp. 636\u2013646.","DOI":"10.1109\/INFCOM.1994.337677"},{"issue":"3","key":"1476_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A Parekh","year":"1993","unstructured":"Parekh, A., & Gallager, R. (1993). A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE\/ACM Transactions on Networking (TON), 1(3), 344\u2013357.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"1476_CR12","doi-asserted-by":"crossref","unstructured":"Miaji, Y., & Hassan, S. (2009). A survey on the chronological evolution of timestamp schedulers in packet switching networks. In Proceedings of IC-BNMT.","DOI":"10.1109\/ICBNMT.2009.5348469"},{"issue":"2","key":"1476_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/90.664266","volume":"6","author":"D Stiliadis","year":"1998","unstructured":"Stiliadis, D., & Varma, A. (1998). Efficient fair queueing algorithms for packet-switched networks. IEEE\/ACM Transactions on Networking (TON), 6(2), 175\u2013185.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"8","key":"1476_CR14","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/49.105173","volume":"9","author":"M Katevenis","year":"1991","unstructured":"Katevenis, M., Stefanos, S., & Courcoubetis, C. (1991). Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE Journal on Selected Areas in Communications, 9(8), 1265\u20131279.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1476_CR15","doi-asserted-by":"crossref","unstructured":"Siriwong, K., Lipsky, L., & Ammar, R. (2007). Study of bursty internet traffic. In Proceedings of IEEE International Symposium on Network Computing and Applications, pp. 53\u201360.","DOI":"10.1109\/NCA.2007.45"},{"key":"1476_CR16","doi-asserted-by":"crossref","unstructured":"Aldeer, M. M. N. (2010). Performance comparison of packet-level multiplexing algorithms with bursty traffic. Journal of Engineering Science and Technology, 3(1), 46\u201352.","DOI":"10.25103\/jestr.031.09"},{"issue":"6","key":"1476_CR17","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/90.477714","volume":"3","author":"SS Lan","year":"1995","unstructured":"Lan, S. S., & Xie, G. G. (1995). Burst scheduling: Architecture and algorithm for switching packet video. IEEE\/ACM Transaction on Networking, 3(6), 683\u2013690.","journal-title":"IEEE\/ACM Transaction on Networking"},{"issue":"12","key":"1476_CR18","doi-asserted-by":"crossref","first-page":"1802","DOI":"10.1109\/26.120166","volume":"39","author":"SJ Golestani","year":"1991","unstructured":"Golestani, S. J. (1991). Congestion-free communication in high-speed packet network. IEEE Transactions on Communications, 39(12), 1802\u20131812.","journal-title":"IEEE Transactions on Communications"},{"issue":"12","key":"1476_CR19","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1109\/12.477249","volume":"44","author":"M Hamadoui","year":"1995","unstructured":"Hamadoui, M., & Ramanathan, P. (1995). A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers Communication, 44(12), 1443\u20131451.","journal-title":"IEEE Transactions on Computers Communication"},{"key":"1476_CR20","doi-asserted-by":"crossref","unstructured":"Callegati, F., Campi, A., & Cerroni, W. (2010). A practical approach to scheduler implementation for optical burst\/packet switching. In Proceedings of ONDM, pp. 1\u20136.","DOI":"10.1109\/ONDM.2010.5431572"},{"issue":"21","key":"1476_CR21","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1109\/JLT.2011.2167498","volume":"29","author":"Z Rosberg","year":"2011","unstructured":"Rosberg, Z., Ji, Li, Fan, Li, & Zukerman, M. (2011). Flow scheduling in optical flow switched (OFS) networks under transient conditions. Journal of Light way Technology, 29(21), 3250\u20133264.","journal-title":"Journal of Light way Technology"},{"key":"1476_CR22","unstructured":"Zhu, H., & Cao, G. (2004). On improving service differentiation under bursty data traffic in wireless networks. In Proceedings of INFOCOM, pp. 871\u2013881."},{"issue":"1","key":"1476_CR23","first-page":"887","volume":"56","author":"DSh Lee","year":"2007","unstructured":"Lee, D Sh, Chen, Ch M, & Tang, Ch-Y. (2007). Weighted Fair Queueing and compensation techniques for wireless packet switched networks. IEEE Transactions on Vehicular Technology, 56(1), 887\u2013891.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"1476_CR24","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1016\/j.comcom.2007.06.003","volume":"30","author":"YJ Choi","year":"2007","unstructured":"Choi, Y. J., & Kim, H. M. (2007). A new scheduling scheme: For high-speed packet networks earliest-virtual-deadline-first. Computer Communications, 30, 2291\u20132300.","journal-title":"Computer Communications"},{"key":"1476_CR25","unstructured":"Kwon, T.G., Lee, S.H., & Rho, J. K. (1998). Scheduling algorithm for real-time burst traffic using dynamic weighted round Robin. IEEE International Symposium on Circuits and Systems, 16, 506\u2013509."},{"key":"1476_CR26","unstructured":"Daneshvar, M. F., Saidi, H., & Mahdavi, M. (2012). A Scheduling algorithm for controlling of service rate and burst. In Proceedings of ADCOM, India."},{"key":"1476_CR27","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1007\/978-3-642-03869-3_100","volume":"5704","author":"R Mart\u2019\u0131nez","year":"2009","unstructured":"Mart\u2019\u0131nez, R., Alfaro, F. J., S\u2019anchez, J. L., & Claver, J. M. (2009). Hardware implementation study of the SCFQ-CA and DRR-CA scheduling algorithms. Lecture Notes in Computer Science, 5704, 1089\u20131100.","journal-title":"Lecture Notes in Computer Science"},{"key":"1476_CR28","doi-asserted-by":"crossref","unstructured":"Halabian, H., & Saidi, H. (2008). A low complexity Fair Queueing algorithm for broadband networks. In Proceedings of ICTTA.","DOI":"10.1109\/ICTTA.2008.4530209"},{"issue":"3","key":"1476_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4218\/etrij.00.0100.0301","volume":"22","author":"BH Choi","year":"2000","unstructured":"Choi, B. H., & Park, H. S. (2000). Rate proportional SCFQ algorithm for high-speed packet-switched networks. ETRI Journal, 22(3), 1\u20139.","journal-title":"ETRI Journal"},{"key":"1476_CR30","doi-asserted-by":"crossref","unstructured":"Koutsakis, P. (2005). Multiplexing voice and SMS traffic with bursty video over next generation wireless networks with capture. In Proceedings of the international conference on parallel processing workshops (ICPPW\u201905).","DOI":"10.1109\/ICPPW.2005.58"},{"key":"1476_CR31","doi-asserted-by":"crossref","unstructured":"Kvols, K., & Blaabjerg, S. (1992). Bounds and approximations for the periodic ON\/OFF queue with applications to ATM traffic control. In Proceedings of INFOCOM, vol. 2, pp. 487\u2013492.","DOI":"10.1109\/INFCOM.1992.263540"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1476-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-013-1476-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-013-1476-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T18:49:16Z","timestamp":1564598956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-013-1476-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,31]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["1476"],"URL":"https:\/\/doi.org\/10.1007\/s11277-013-1476-2","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,31]]}}}