{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:29Z","timestamp":1740160289068,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T00:00:00Z","timestamp":1444348800000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s13042-015-0437-3","type":"journal-article","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T05:31:46Z","timestamp":1444368706000},"page":"275-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Restricted overlay routing"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6751-9411","authenticated-orcid":false,"given":"Shu","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongxing","family":"Ming","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,9]]},"reference":[{"key":"437_CR1","doi-asserted-by":"crossref","unstructured":"Andersen DG, Balakrishnan H, Kaashoek F, Morris R (2001) Resilient overlay networks. In: 18th ACM SOSP, Banff, Canada","DOI":"10.1145\/502034.502048"},{"key":"437_CR2","doi-asserted-by":"crossref","unstructured":"Andreev K, Maggs BM, Meyerson A, Sitaraman RK (2003) Designing overlay multicast networks for streaming. In: SPAA, pp 149\u2013158","DOI":"10.1145\/777412.777437"},{"key":"437_CR3","doi-asserted-by":"crossref","unstructured":"Chen Y, Tang L, Li (2008) Heuristic relay node selection algorithm for one-hop overlay routing. In: ICDCS Workshops, pp 465\u2013470","DOI":"10.1109\/ICDCS.Workshops.2008.45"},{"issue":"3","key":"437_CR4","first-page":"1","volume":"63","author":"D Clark","year":"2006","unstructured":"Clark D, Lehr B, Bauer S, Faratin P, Sami R, Wroclawski J (2006) Overlay networks and the future of the internet. Commun Strateg 63(3):1","journal-title":"Commun Strateg"},{"issue":"3","key":"437_CR5","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1109\/TNET.2007.900702","volume":"16","author":"R Cohen","year":"2008","unstructured":"Cohen R, Nakibly G (2008) On the computational complexity and effectiveness of n-hub shortest-path routing. IEEE\/ACM Trans Netw 16(3):691\u2013704","journal-title":"IEEE\/ACM Trans Netw"},{"key":"437_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01580609","volume":"60","author":"G Pillo Di","year":"1993","unstructured":"Di Pillo G, Grippo L, Lucidi S (1993) A smooth method for the finite minimax problem. Math Program 60:187\u2013214. doi: 10.1007\/BF01580609","journal-title":"Math Program"},{"issue":"10","key":"437_CR7","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B Fortz","year":"2002","unstructured":"Fortz B, Rexford J, Thorup M (2002) Traffic engineering with traditional ip routing protocols. IEEE Commun Mag 40(10):118\u2013124","journal-title":"IEEE Commun Mag"},{"key":"437_CR8","unstructured":"Friedmang E (2004) A generic analysis of selfish routing. In Proceedings of the 43rd IEEE Conference on Decision and Control, Bahamas, 14\u201317 Dec 2004"},{"key":"437_CR9","unstructured":"Gummadi PK, Madhyastha HV, Gribble SD, Levy HM, Wetherall D (2004) Improving the reliability of internet paths with one-hop source routing. In: OSDI, pp 183\u2013198"},{"issue":"2","key":"437_CR10","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MNET.2008.4476066","volume":"22","author":"J He","year":"2008","unstructured":"He J, Rexford J (2008) Toward internet-wide multipath routing. IEEE Netw 22(2):16\u201321","journal-title":"IEEE Netw"},{"key":"437_CR11","doi-asserted-by":"crossref","unstructured":"Lee GM, T Choi (2008) Improving the interaction between overlay routing and traffic engineering. Hoc and Sensor Networks Wireless Networks Next Generation Internet 7th International Ifip Tc6 Networking Conference, Singapore 5\u20139 May 2008","DOI":"10.1007\/978-3-540-79549-0_46"},{"key":"437_CR12","unstructured":"Li A, Lu Y, Yang X (2008) Price of path diversity: in practice and in theory. http:\/\/www.cs.duke.edu\/nds\/papers\/ppd.pdf"},{"issue":"1","key":"437_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/JSAC.2003.818782","volume":"22","author":"Z Li","year":"2004","unstructured":"Li Z, Mohapatra P (2004) Qron: Qos-aware routing in overlay networks. IEEE J Sel Areas Commun 22(1):29\u201340","journal-title":"IEEE J Sel Areas Commun"},{"key":"437_CR14","unstructured":"Liu Y, Zhang H, Gong W, Towsley DF (2006) On the interaction between overlay routing and underlay routing. In: INFOCOM, pp 2543\u20132553"},{"key":"437_CR15","unstructured":"lp $$\\_$$ _ solve. http:\/\/lpsolve.sourceforge.net"},{"key":"437_CR16","unstructured":"Medina A, Matta I, Byers J (2000) Brite: a flexible generator of internet topologies. Technical report, Boston, MA, USA"},{"key":"437_CR17","doi-asserted-by":"crossref","unstructured":"Motiwala M, Feamster N, Vempala S (2007) Path splicing: reliable connectivity with rapid recovery. In: in Proc, SIGCOMM Workshop on Hot Topics in Networking","DOI":"10.1145\/1402958.1402963"},{"key":"437_CR18","doi-asserted-by":"crossref","unstructured":"Qiu L, Yang YR, Zhang Y, Shenker S (2003) On selfish routing in internet-like environments. In: SIGCOMM \u201903: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. ACM, New York, NY, USA, pp 151\u2013162","DOI":"10.1145\/863955.863974"},{"key":"437_CR19","unstructured":"Roughgarden T (2002) Selfish routing. PhD thesis, Cornell University, 2002"},{"issue":"2","key":"437_CR20","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden T, Tardos \u00c9 (2002) How bad is selfish routing? J ACM 49(2):236\u2013259","journal-title":"J ACM"},{"key":"437_CR21","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/40.748796","volume":"19","author":"S Savage","year":"1999","unstructured":"Savage S, Anderson T, Aggarwal A, Becker D, Cardwell N, Collins A, Hoffman E, Snell J, Vahdat A, Voelker G, Zahorjan J (1999) Detour: Informed internet routing and transport. IEEE Micro 19:50\u201359","journal-title":"IEEE Micro"},{"key":"437_CR22","doi-asserted-by":"crossref","unstructured":"Savage S, Collins A, Hoffman E, Snell J, Anderson TE (1999) The end-to-end effects of internet path selection. In: SIGCOMM, pp 289\u2013299","DOI":"10.1145\/316188.316233"},{"key":"437_CR23","unstructured":"Seetharaman S, Ammar M (2005) Overlay-friendly native network: a contradiction in terms? In: HOTNETS IV"},{"issue":"6","key":"437_CR24","doi-asserted-by":"crossref","first-page":"1964","DOI":"10.1109\/TNET.2009.2018280","volume":"17","author":"S Seetharaman","year":"2009","unstructured":"Seetharaman S, Hilt V, Hofmann M, Ammar MH (2009) Resolving cross-layer conflict between overlay routing and traffic engineering. IEEE\/ACM Trans Netw 17(6):1964\u20131977","journal-title":"IEEE\/ACM Trans Netw"},{"key":"437_CR25","doi-asserted-by":"crossref","unstructured":"Sen A, Hao B, Shen BH, Murthy S, Ganguly S (2005) On multipath routing with transit hubs. In: NETWORKING, pp 1043\u20131055","DOI":"10.1007\/11422778_84"},{"key":"437_CR26","doi-asserted-by":"crossref","unstructured":"Sontag D, Zhang Y, Phanishayee A, Andersen D, Karger D (2009) Scaling all-pairs overlay routing. In: CoNEXT \u201909: Proceedings of the 5th international conference on Emerging networking experiments and technologies. ACM, New York, NY, USA, pp 145\u2013156","DOI":"10.1145\/1658939.1658956"},{"key":"437_CR27","doi-asserted-by":"crossref","unstructured":"Spring NT, Mahajan R, Wetherall D (2002) Measuring isp topologies with rocketfuel. In: SIGCOMM, pp 133\u2013145","DOI":"10.1145\/633025.633039"},{"key":"437_CR28","doi-asserted-by":"crossref","unstructured":"Tangmunarunkit H, Govindan R, Shenker S, Estrin D (2001) The impact of routing policy on internet paths. In: INFOCOM, pp 736\u2013742","DOI":"10.1109\/INFCOM.2001.916262"},{"key":"437_CR29","doi-asserted-by":"crossref","unstructured":"Tao S, Xu K, Xu Y, Fei T, Gao L, Gu\u00e9rin R, Kurose JF, Towsley DF, Zhang ZL (2004) Exploring the performance benefits of end-to-end path switching. In: ICNP, pp 304\u2013315","DOI":"10.1145\/1005686.1005746"},{"key":"437_CR30","doi-asserted-by":"crossref","unstructured":"Vutukury S, Garcia-Luna-Aceves JJ (1999) A simple approximation to minimum-delay routing. In: SIGCOMM, pp 227\u2013238","DOI":"10.1145\/316188.316227"},{"issue":"3","key":"437_CR31","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TFUZZ.2008.924342","volume":"17","author":"X Wang","year":"2009","unstructured":"Wang X, Dong C (2009) Improving generalization of fuzzy if-then rules by maximizing fuzzy entropy. IEEE Trans Fuzzy Syst 17(3):556\u2013567","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"8","key":"437_CR32","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TKDE.2011.67","volume":"24","author":"X Wang","year":"2012","unstructured":"Wang X, Dong L, Yan J (2012) Maximum ambiguity based sample selection in fuzzy decision tree induction. IEEE Trans Knowl Data Eng 24(8):1491\u20131505","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"437_CR33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TCYB.2013.2245891","volume":"44","author":"X Wang","year":"2014","unstructured":"Wang X, He Y, Wang DD (2014) Non-naive bayesian classifiers for classification problems with continuous attributes. IEEE Trans Cybern 44(1):21\u201339","journal-title":"IEEE Trans Cybern"},{"key":"437_CR34","doi-asserted-by":"crossref","unstructured":"Wang X, Xing H, Li Y (2014) A study on relationship between generalization abilities and fuzziness of base classifiers in ensemble learning. IEEE Trans Fuzzy Syst. doi: 10.1109\/TFUZZ.2014.2371479","DOI":"10.1109\/TFUZZ.2014.2371479"},{"issue":"6","key":"437_CR35","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.comnet.2005.07.015","volume":"50","author":"Y Zhu","year":"2006","unstructured":"Zhu Y, Dovrolis C, Ammar MH (2006) Dynamic overlay routing based on available bandwidth estimation: a simulation study. Computer Netw 50(6):742\u2013762","journal-title":"Computer Netw"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0437-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0437-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0437-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T06:19:24Z","timestamp":1567232364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0437-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,9]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["437"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0437-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2015,10,9]]}}}