{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:01:37Z","timestamp":1648936897872},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:00:00Z","timestamp":1427760000000},"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":["Wireless Netw"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11276-015-0933-0","type":"journal-article","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T09:08:43Z","timestamp":1427706523000},"page":"2609-2615","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum average relative load for online routing"],"prefix":"10.1007","volume":"21","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azam","family":"Ramezanipour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,31]]},"reference":[{"key":"933_CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44, 486\u2013504.","journal-title":"Journal of the ACM"},{"key":"933_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., & Plotkin, S. (1993). Throughput-competitive on-line routing. In FOCS 93: Proceedings of the 1993 IEEE 34th annual foundations of computer science (pp. 32\u201340). Washington, DC, USA: IEEE Computer Society.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"933_CR3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jcss.1999.1662","volume":"62","author":"B Awerbuch","year":"2001","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S., & Waarts, O. (2001). Competitive routing of virtual circuits with unknown duration. Journal of Computer and System Sciences, 62, 385\u2013397.","journal-title":"Journal of Computer and System Sciences"},{"key":"933_CR4","doi-asserted-by":"crossref","unstructured":"Bansal, N., Lee, K. W., Nagarajan, V., & Zafer, M. (2011). Minimum congestion mapping in a cloud. In PODC (pp. 267\u2013276).","DOI":"10.1145\/1993806.1993854"},{"key":"933_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., & Naor, J. (2006). Improved bounds for online routing and packing via a primal-dual approach. In Annual IEEE symposium on foundations of computer science (pp. 293\u2013304).","DOI":"10.1109\/FOCS.2006.39"},{"key":"933_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1561\/0400000024","volume":"3","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., & Naor, J. (2009). The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science, 3, 99\u2013263.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"933_CR7","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"C Busch","year":"2012","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating ongestion + ilation in networks via quality of routing games. IEEE Transactions on Computers, 61, 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"933_CR8","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.adhoc.2011.02.004","volume":"10","author":"H Cheng","year":"2012","unstructured":"Cheng, H., Xiongb, N., Vasilakosc, A. V., Yangd, L. T., Chena, G., & Zhuanga, X. (2012). Nodes organization for channel assignment withtopology preservation in multi-radio wireless mesh networks. Ad Hoc networks, 10(5), 760\u2013773.","journal-title":"Ad Hoc networks"},{"key":"933_CR9","author":"N Chilamkurti","year":"2009","unstructured":"Chilamkurti, N., Zeadally, S., Vasilakos, A., & Sharma, V. (2009). Cross-layer support for energy efficient routing in wireless sensor networks. Journal of Sensors. doi: 10.1155\/2009\/134165 .","journal-title":"Journal of Sensors"},{"issue":"3","key":"933_CR10","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TNSM.2012.031512.110165","volume":"9","author":"A Cianfrani","year":"2012","unstructured":"Cianfrani, A., Eramo, V., Listanti, M., & Polverini, M. (2012). An OSPF-integrated routing strategy for qos-aware energy saving in IP backbone networks. IEEE Transactions on Network and Service Management, 9(3), 254\u2013267.","journal-title":"IEEE Transactions on Network and Service Management"},{"key":"933_CR11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-38016-7_3","volume":"7846","author":"G Even","year":"2013","unstructured":"Even, G., & Medina, M. (2013). Online multi-commodity flow with high demands. Approximation and Online Algorithms, 7846, 16\u201329.","journal-title":"Approximation and Online Algorithms"},{"key":"933_CR12","doi-asserted-by":"crossref","unstructured":"Even, G., Medina, M., Schaffrath, G., & Schmid, S. (2012). Competitive and deterministic embeddings of virtual networks. In ICDCN (pp. 106\u2013121).","DOI":"10.1007\/978-3-642-25959-3_8"},{"issue":"12","key":"933_CR13","doi-asserted-by":"crossref","first-page":"2538","DOI":"10.1109\/JPROC.2013.2257631","volume":"101","author":"M Li","year":"2013","unstructured":"Li, M., Li, Z., & Vasilakos, A. V. (2013). A survey on topology control in wireless sensor networks: Taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538\u20132557.","journal-title":"Proceedings of the IEEE"},{"key":"933_CR14","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2012). An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM (pp. 100\u2013108)."},{"key":"933_CR15","doi-asserted-by":"crossref","unstructured":"Quan, W., Xu, C., Vasilakos, A. V., Guan, J., Zhang, H., & Grieco, L. A. (2014). Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. IFIP networking.","DOI":"10.1109\/IFIPNetworking.2014.6857122"},{"key":"933_CR16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D. D., & Tarjan, R. E. (1985). Amortized efficiency of list update and paging rules. Communication of the ACM, 28, 202\u2013208.","journal-title":"Communication of the ACM"},{"issue":"8","key":"933_CR17","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"issue":"3","key":"933_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TSMCC.2003.817354","volume":"33","author":"AV Vasilakos","year":"2003","unstructured":"Vasilakos, A. V., Saltouros, M. P., Atlassis, A. F., & Pedrycz, W. (2003). Optimizing qos routing in hierarchical ATM networks using computational intelligence techniques. IEEE Transactions on Systems, Man, and Cybernetics, 33(3), 297\u2013312.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"933_CR19","volume-title":"Delay tolerant networks: Protocols and applications","author":"AV Vasilakos","year":"2012","unstructured":"Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2012). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press."},{"issue":"1","key":"933_CR20","first-page":"4","volume":"17","author":"X Wang","year":"2012","unstructured":"Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. MONET, 17(1), 4\u201320.","journal-title":"MONET"},{"key":"933_CR21","doi-asserted-by":"crossref","unstructured":"Xiang, L., Luo, J., & Vasilakos, A. V. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In IEEE SECON.","DOI":"10.1109\/SAHCN.2011.5984932"},{"key":"933_CR22","doi-asserted-by":"crossref","unstructured":"Yao, Y., Cao, Q., & Vasilakos, A. V. (2013). An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In MASS (pp. 182\u2013190).","DOI":"10.1109\/MASS.2013.44"},{"key":"933_CR23","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"YS Yen","year":"2011","unstructured":"Yen, Y. S., Chao, H. C., Chang, R. S., & Vasilakos, A. V. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53, 2238\u20132250.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1","key":"933_CR24","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., Ibrahim, M., Abdelatif, M., Che, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"2","key":"933_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"7","key":"933_CR26","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1109\/JSAC.2011.110803","volume":"29","author":"L Zhou","year":"2011","unstructured":"Zhou, L., Chao, H. C., & Vasilakos, A. V. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. IEEE Journal on Selected Areas in Communications, 29(7), 1358\u20131367.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-0933-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-015-0933-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-0933-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:04:07Z","timestamp":1559379847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-015-0933-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,31]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1007\/s11276-015-0933-0","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,31]]}}}