{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:40:57Z","timestamp":1777682457725,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of High Speed Networks"],"published-print":{"date-parts":[[1992,5]]},"abstract":"<jats:p>This paper presents a congestion control scheme based on alternate path routing. In the scheme, if a node encounters congestion or loses its preferred neighbor on its primary path to a destination, it sends data packets to that destination over precomputed alternate paths. The scheme ensures that data packets do not travel in loops and limits the spread of congestion to neighboring nodes. Simulations of the scheme show that alternate path routing reduces the number of dropped packets, achieves a more uniform link utilization and alleviates congestion in networks under light to moderate loading. When using alternate path routing, it is observed that the loss ratio closely follows the load ratio which is not true when using shortest path routing.<\/jats:p>","DOI":"10.3233\/jhs-1992-1202","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T09:47:32Z","timestamp":1575366452000},"page":"129-144","source":"Crossref","is-referenced-by-count":9,"title":["Congestion Control in High Speed Networks via Alternate Path Routing"],"prefix":"10.1177","volume":"1","author":[{"given":"Deepinder","family":"Sidhu","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Maryland \u2013 BC, Baltimore, MD 21228, USA"},{"name":"Institute for Advanced Cumputer Studies, University of Maryland \u2013 CP, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukri","family":"Abdallah","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland \u2013 BC, Baltimore, MD 21228, USA"},{"name":"Institute for Advanced Cumputer Studies, University of Maryland \u2013 CP, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj","family":"Nair","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland \u2013 BC, Baltimore, MD 21228, USA"},{"name":"Institute for Advanced Cumputer Studies, University of Maryland \u2013 CP, College Park, MD 20742, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1992,1,1]]},"container-title":["Journal of High Speed Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JHS-1992-1202","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JHS-1992-1202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:43:03Z","timestamp":1777452183000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JHS-1992-1202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["10.3233\/JHS-1992-1202"],"URL":"https:\/\/doi.org\/10.3233\/jhs-1992-1202","relation":{},"ISSN":["0926-6801","1875-8940"],"issn-type":[{"value":"0926-6801","type":"print"},{"value":"1875-8940","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1,1]]}}}