{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:13:23Z","timestamp":1761707603877,"version":"3.30.2"},"reference-count":35,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s1389-1286(03)00319-0","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:47:57Z","timestamp":1057585677000},"page":"787-804","source":"Crossref","is-referenced-by-count":17,"title":["IP-in-IP tunneling to enable the simultaneous use of multiple IP interfaces for network level connection striping"],"prefix":"10.1016","volume":"43","author":[{"given":"Dhananjay S.","family":"Phatak","sequence":"first","affiliation":[]},{"given":"Tom","family":"Goff","sequence":"additional","affiliation":[]},{"given":"Jim","family":"Plusquellic","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00319-0_BIB1","doi-asserted-by":"crossref","unstructured":"G. Malkin, Nortel networks multi-link multi-node PPP bundle discovery protocol, RFC 2701, September 1999","DOI":"10.17487\/rfc2701"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB2","doi-asserted-by":"crossref","unstructured":"K. Sklower, B. Lloyd, G. McGregor, D. Carr, T. Coradetti, The PPP multilink protocol (MP), RFC 1990, August 1996","DOI":"10.17487\/rfc1990"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB3","doi-asserted-by":"crossref","unstructured":"E.W. Simpson, The point-to-point protocol (PPP), RFC 1661, July 1994","DOI":"10.17487\/rfc1661"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB4","doi-asserted-by":"crossref","unstructured":"E.W. Simpson, PPP in HDLC-like framing, RFC 1662, July 1994","DOI":"10.17487\/rfc1662"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB5","doi-asserted-by":"crossref","unstructured":"D. Rand, PPP reliable transmission, RFC 1663, July 1994","DOI":"10.17487\/rfc1663"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/18.212275","article-title":"Distributed algorithms for computing shortest pairs of disjoint paths","volume":"39","author":"Ogier","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB7","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/90.811453","article-title":"Analysis of multi-path routing","volume":"7","author":"Cidon","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB8","doi-asserted-by":"crossref","unstructured":"N. Taft-Plotkin, B. Bellur, R. Ogier, Quality of service routing using maximally disjoint paths, in: Proceedings of the IEEE IWQoS\u201999, London, UK, June 1999, pp. 119\u2013128","DOI":"10.1109\/IWQOS.1999.766485"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB9","doi-asserted-by":"crossref","unstructured":"A. Nasipuri, S.R. Das, On-demand multipath routing for ad-hoc networks, in: Proceedings of the IEEE ICCCN\u201999, Boston, MA, October 1999, pp. 64\u201370","DOI":"10.1109\/ICCCN.1999.805497"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB10","doi-asserted-by":"crossref","unstructured":"J. Raju, J. Garcia-Luna-Aceves, A new approach to on-demand multipath routing, in: Proceedings of the IEEE ICCCN\u201999, Boston, MA, October 1999, pp. 522\u2013527","DOI":"10.1109\/ICCCN.1999.805568"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB11","doi-asserted-by":"crossref","unstructured":"M. Pearlman, Z. Haas, P. Scholander, S. Tabrizi, On the impact of alternate path routing for load balancing in mobile ad hoc networks, in: Proceedings of ACM MobiHOC\u201900, Boston, MA, August 2000, pp. 119\u2013128","DOI":"10.1109\/MOBHOC.2000.869207"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB12","unstructured":"M. Gerla, S.-J. Lee, Split multipath routing with maximally disjoint paths in ad hoc networks, in: Proceedings of ICC\u201901, Helsinki, Finland, June 2001"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB13","doi-asserted-by":"crossref","unstructured":"W.-H. Liao et al., A multi-path QoS routing protocol in a wireless mobile ad hoc network, in: Proceedings of the IEEE ICN\u201900, CREF, Colmar, France, July 2001","DOI":"10.1007\/3-540-47734-9_16"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB14","doi-asserted-by":"crossref","unstructured":"A. Snoeren, Adaptive inverse multiplexing for wide-area wireless networks, in: IEEE Globecom, 1999, pp. 1665\u20131672","DOI":"10.1109\/GLOCOM.1999.832447"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB15","doi-asserted-by":"crossref","unstructured":"H. Adiseshu, G. Parulkar, G. Varghese, A reliable and scalable striping protocol, in: SIGCOMM: ACM Special Interest Group on Data Communication, Palo Alto, CA, August 1996, pp. 131\u2013141","DOI":"10.1145\/248156.248169"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB16","unstructured":"D.C. Anderson, J.S. Chase, A.M. Vahdat, Interposed request routing for scalable network storage, in: Proceedings of the Fourth Symposium on Operating System Design and Implementation (OSDI), October 2000"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB17","unstructured":"Sun Microsystems, Sun StorEdge network data replicator white paper, http:\/\/www.sun.com\/storage\/white-papers\/sndr.html"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB18","unstructured":"A. Watson, Network Appliance, Inc., Filer deployment strategies for evolving LAN topologies, http:\/\/www.netapp.com\/tech_library\/3009.html"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB19","unstructured":"R. Haagens, iSCSI requirements, http:\/\/www.ietf.org\/proceedings\/00jul\/SLIDES\/ips-iscsi-reqs.pdf"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB20","unstructured":"Cisco Systems, Etherchannel technologies, http:\/\/www.cisco.com\/warp\/public\/779\/largeent\/learn\/technologies\/fast_echannel.html"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB21","unstructured":"SCTP reference implementation, http:\/\/www.sctp.org\/"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB22","unstructured":"GPL SCTP prototype implementation, http:\/\/www.sctp.de\/"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB23","unstructured":"SCTP for beginners, http:\/\/tdrwww.exp-math.uni-essen.de\/pages\/forschung\/sctp_fb"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB24","unstructured":"SCTP: an overview, http:\/\/sctp.chicago.il.us\/sctpoverview.html"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB25","unstructured":"Protocol Engineering Lab at University of Delaware CIS Department, http:\/\/www.cis.udel.edu\/iyengar\/research\/SCTP"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB26","unstructured":"R.R. Stewart, M.A. Ramalho, et al., SCTP extensions for dynamic reconfiguration of IP addresses and enforcement of flow and message limits, June 2001, http:\/\/www.ietf.org\/internet-drafts\/draft-ietf-tsvwg-addip-sctp-02.txt"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB27","doi-asserted-by":"crossref","unstructured":"E.C. Perkins, IP mobility support, RFC 2002, October 1996","DOI":"10.17487\/rfc3344"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB28","doi-asserted-by":"crossref","unstructured":"C. Perkins, IP encapsulation within IP, RFC 2003, October 1996","DOI":"10.17487\/rfc2003"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB29","doi-asserted-by":"crossref","unstructured":"C. Perkins, Minimal Encapsulation within IP, RFC 2004, October 1996","DOI":"10.17487\/rfc2004"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB30","doi-asserted-by":"crossref","unstructured":"J. Solomon, Applicability statement for IP mobility support, RFC 2005, October 1996","DOI":"10.17487\/rfc2005"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB31","unstructured":"V. Jacobson, Modified TCP congestion avoidance algorithm, end2end interest group mailing list, April 1990"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB32","doi-asserted-by":"crossref","unstructured":"M. Shreedhar, G. Varghese, Efficient fair queuing using deficit round robin, in: SIGCOMM: ACM Special Interest Group on Data Communication, Cambridge, MA, September 1995, pp. 231\u2013242","DOI":"10.1145\/217391.217453"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB33","unstructured":"S. McCanne, S. Floyd, NS network simulator, http:\/\/www.isi.edu\/nsnam\/ns\/"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/251007.251012","article-title":"Dummynet: a simple approach to the evaluation of network protocols","volume":"27","author":"Rizzo","year":"1997","journal-title":"ACM Computer Communication Review"},{"key":"10.1016\/S1389-1286(03)00319-0_BIB35","unstructured":"Information Networks Division, Hewlett\u2013Packard Company, Netperf: A network performance benchmark, 15 February 1996, http:\/\/www.netperf.org\/"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003190?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003190?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T04:33:02Z","timestamp":1734064382000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603003190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1389128603003190"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00319-0","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}