Routing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Routing" in English language version.

Last modified: 15:15:54, 5 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

66doi.org

2^nd place

44web.archive.org

1^st place

33researchgate.net

96^th place

89^th place

33arxiv.org

49^th place

31^st place

33microsoft.com

263^rd place

259^th place

22sciencedirect.com

137^th place

146^th place

22worldcat.org

4^th place

22semanticscholar.org

15^th place

8^th place

11rfc-editor.org

747^th place

325^th place

11baumann.info

low place

11eecs.harvard.edu

low place

11inspirehep.net

low place

11tudelft.nl

7,254^th place

5,846^th place

11princeton.edu

802^nd place

528^th place

11washington.edu

1,171^st place

736^th place

11psu.edu

299^th place

159^th place

11fb.com

low place

9,605^th place

11networkcomputing.com

low place

11adsabs.harvard.edu

14^th place

9^th place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018). "On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN". IEEE Communications Letters. 22 (12): 2475–2478. arXiv:1810.00169. Bibcode:2018arXiv181000169N. doi:10.1109/LCOMM.2018.2872980. S2CID 52898719.

arxiv.org (Global: 49^th place; English: 31^st place)

Noormohammadpour, M.; Raghavendra, C. S. (Apr 2018). "Poster Abstract: Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks". IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). pp. 1–2. arXiv:1802.09080. doi:10.1109/INFCOMW.2018.8406853. ISBN 978-1-5386-5979-3 – via ResearchGate.
Noormohammadpour, Mohammad; Raghavendra, Cauligi (16 July 2018). "Datacenter Traffic Control: Understanding Techniques and Tradeoffs". IEEE Communications Surveys and Tutorials. 20 (2): 1492–1525. arXiv:1712.03530. doi:10.1109/COMST.2017.2782753. S2CID 28143006.
Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018). "On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN". IEEE Communications Letters. 22 (12): 2475–2478. arXiv:1810.00169. Bibcode:2018arXiv181000169N. doi:10.1109/LCOMM.2018.2872980. S2CID 52898719.

baumann.info (Global: low place; English: low place)

rainer.baumann.info

Baumann, Rainer; Heimlicher, Simon; Strasser, Mario; Weibel, Andreas (February 10, 2007), A Survey on Routing Metrics (PDF), retrieved 2020-05-04

doi.org (Global: 2^nd place; English: 2^nd place)

Goścień, Róża; Walkowiak, Krzysztof; Klinkowski, Mirosław (2015-03-14). "Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic". Computer Networks. 79: 148–165. doi:10.1016/j.comnet.2014.12.004. ISSN 1389-1286.
Noormohammadpour, M.; Raghavendra, C. S. (Apr 2018). "Poster Abstract: Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks". IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). pp. 1–2. arXiv:1802.09080. doi:10.1109/INFCOMW.2018.8406853. ISBN 978-1-5386-5979-3 – via ResearchGate.
Noormohammadpour, M; Raghavendra, C. S. (Apr 2018). "Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks". doi:10.13140/RG.2.2.36009.90720 – via ResearchGate.
Shahaf Yamin and Haim H. Permuter. "Multi-agent reinforcement learning for network routing in integrated access backhaul networks". Ad Hoc Networks, Volume 153, 2024, 103347, ISSN 1570-8705, doi:10.1016/j.adhoc.2023.103347.
Noormohammadpour, Mohammad; Raghavendra, Cauligi (16 July 2018). "Datacenter Traffic Control: Understanding Techniques and Tradeoffs". IEEE Communications Surveys and Tutorials. 20 (2): 1492–1525. arXiv:1712.03530. doi:10.1109/COMST.2017.2782753. S2CID 28143006.
Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018). "On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN". IEEE Communications Letters. 22 (12): 2475–2478. arXiv:1810.00169. Bibcode:2018arXiv181000169N. doi:10.1109/LCOMM.2018.2872980. S2CID 52898719.

eecs.harvard.edu (Global: low place; English: low place)

Michael Mitzenmacher; Andréa W. Richa; Ramesh Sitaraman, "Randomized Protocols for Circuit Routing", The Power of Two Random Choices: A Survey of Techniques and Results (PDF), p. 34, archived (PDF) from the original on Dec 13, 2023

fb.com (Global: low place; English: 9,605^th place)

code.fb.com

"Building Express Backbone: Facebook's new long-haul network". May 1, 2017.

inspirehep.net (Global: low place; English: low place)

Stefan Haas (1998), "The IEEE 1355 Standard: Developments, Performance and Application in High Energy Physics" (PDF), INSPIRE, p. 15, archived (PDF) from the original on May 16, 2019, To eliminate network hot spots, ... a two phase routing algorithm. This involves every packet being first sent to a randomly chosen intermediate destination; from the intermediate destination it is forwarded to its final destination. This algorithm, referred to as Universal Routing, is designed to maximize capacity and minimize delay under conditions of heavy load.

microsoft.com (Global: 263^rd place; English: 259^th place)

research.microsoft.com

Ratul Mahajan, David Wetherall, and Thomas Anderson. "Negotiation-Based Routing Between Neighboring ISPs". Proc. NSDI 2005.
Ratul Mahajan, David Wetherall, and Thomas Anderson. Mutually Controlled Routing with Independent ISPs. Proc. NSDI 2007.

azure.microsoft.com

Khalidi, Yousef (March 15, 2017). "How Microsoft builds its fast and reliable global network".

networkcomputing.com (Global: low place; English: low place)

"Inside Google's Software-Defined Network". Network Computing. May 14, 2017. Archived from the original on December 8, 2018. Retrieved October 8, 2018.

princeton.edu (Global: 802^nd place; English: 528^th place)

cs.princeton.edu

Matthew Caesar and Jennifer Rexford. "BGP routing policies in ISP networks". IEEE Network Magazine, special issue on Interdomain Routing, Nov/Dec 2005.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Santhi, P.; Ahmed, Md Shakeel; Mehertaj, Sk; Manohar, T. Bharath. An Efficient Security Way of Authentication and Pair wise Key Distribution with Mobile Sinks in Wireless Sensor Networks. CiteSeerX 10.1.1.392.151. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

researchgate.net (Global: 96^th place; English: 89^th place)

Noormohammadpour, M.; Raghavendra, C. S. (Apr 2018). "Poster Abstract: Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks". IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). pp. 1–2. arXiv:1802.09080. doi:10.1109/INFCOMW.2018.8406853. ISBN 978-1-5386-5979-3 – via ResearchGate.
Noormohammadpour, M; Raghavendra, C. S. (Apr 2018). "Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks". doi:10.13140/RG.2.2.36009.90720 – via ResearchGate.
Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018). "On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN". IEEE Communications Letters. 22 (12): 2475–2478. arXiv:1810.00169. Bibcode:2018arXiv181000169N. doi:10.1109/LCOMM.2018.2872980. S2CID 52898719.

rfc-editor.org (Global: 747^th place; English: 325^th place)

RFC 1322

sciencedirect.com (Global: 137^th place; English: 146^th place)

Goścień, Róża; Walkowiak, Krzysztof; Klinkowski, Mirosław (2015-03-14). "Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic". Computer Networks. 79: 148–165. doi:10.1016/j.comnet.2014.12.004. ISSN 1389-1286.
Shahaf Yamin and Haim H. Permuter. "Multi-agent reinforcement learning for network routing in integrated access backhaul networks". Ad Hoc Networks, Volume 153, 2024, 103347, ISSN 1570-8705, doi:10.1016/j.adhoc.2023.103347.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Noormohammadpour, Mohammad; Raghavendra, Cauligi (16 July 2018). "Datacenter Traffic Control: Understanding Techniques and Tradeoffs". IEEE Communications Surveys and Tutorials. 20 (2): 1492–1525. arXiv:1712.03530. doi:10.1109/COMST.2017.2782753. S2CID 28143006.
Noormohammadpour, Mohammad; Srivastava, Ajitesh; Raghavendra, Cauligi (2018). "On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN". IEEE Communications Letters. 22 (12): 2475–2478. arXiv:1810.00169. Bibcode:2018arXiv181000169N. doi:10.1109/LCOMM.2018.2872980. S2CID 52898719.

tudelft.nl (Global: 7,254^th place; English: 5,846^th place)

st.ewi.tudelft.nl

Zutt, Jonne; van Gemund, Arjan J.C.; de Weerdt, Mathijs M.; Witteveen, Cees (2010). "Dealing with Uncertainty in Operational Transport Planning" (PDF). Archived from the original (PDF) on Sep 22, 2017. In R.R. Negenborn and Z. Lukszo and H. Hellendoorn (Eds.) Intelligent Infrastructures, Ch. 14, pp. 355–382. Springer.

washington.edu (Global: 1,171^st place; English: 736^th place)

cs.washington.edu

Neil Spring, Ratul Mahajan, and Thomas Anderson. "Quantifying the Causes of Path Inflation". Proc. SIGCOMM 2003.

web.archive.org (Global: 1^st place; English: 1^st place)

Michael Mitzenmacher; Andréa W. Richa; Ramesh Sitaraman, "Randomized Protocols for Circuit Routing", The Power of Two Random Choices: A Survey of Techniques and Results (PDF), p. 34, archived (PDF) from the original on Dec 13, 2023
Stefan Haas (1998), "The IEEE 1355 Standard: Developments, Performance and Application in High Energy Physics" (PDF), INSPIRE, p. 15, archived (PDF) from the original on May 16, 2019, To eliminate network hot spots, ... a two phase routing algorithm. This involves every packet being first sent to a randomly chosen intermediate destination; from the intermediate destination it is forwarded to its final destination. This algorithm, referred to as Universal Routing, is designed to maximize capacity and minimize delay under conditions of heavy load.
Zutt, Jonne; van Gemund, Arjan J.C.; de Weerdt, Mathijs M.; Witteveen, Cees (2010). "Dealing with Uncertainty in Operational Transport Planning" (PDF). Archived from the original (PDF) on Sep 22, 2017. In R.R. Negenborn and Z. Lukszo and H. Hellendoorn (Eds.) Intelligent Infrastructures, Ch. 14, pp. 355–382. Springer.
"Inside Google's Software-Defined Network". Network Computing. May 14, 2017. Archived from the original on December 8, 2018. Retrieved October 8, 2018.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Goścień, Róża; Walkowiak, Krzysztof; Klinkowski, Mirosław (2015-03-14). "Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic". Computer Networks. 79: 148–165. doi:10.1016/j.comnet.2014.12.004. ISSN 1389-1286.
Shahaf Yamin and Haim H. Permuter. "Multi-agent reinforcement learning for network routing in integrated access backhaul networks". Ad Hoc Networks, Volume 153, 2024, 103347, ISSN 1570-8705, doi:10.1016/j.adhoc.2023.103347.

Routing (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

baumann.info (Global: low place; English: low place)

rainer.baumann.info

doi.org (Global: 2nd place; English: 2nd place)

eecs.harvard.edu (Global: low place; English: low place)

fb.com (Global: low place; English: 9,605th place)

code.fb.com

inspirehep.net (Global: low place; English: low place)

microsoft.com (Global: 263rd place; English: 259th place)

research.microsoft.com

azure.microsoft.com

networkcomputing.com (Global: low place; English: low place)

princeton.edu (Global: 802nd place; English: 528th place)

cs.princeton.edu

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

researchgate.net (Global: 96th place; English: 89th place)

rfc-editor.org (Global: 747th place; English: 325th place)

sciencedirect.com (Global: 137th place; English: 146th place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

tudelft.nl (Global: 7,254th place; English: 5,846th place)

st.ewi.tudelft.nl

washington.edu (Global: 1,171st place; English: 736th place)

cs.washington.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

fb.com (Global: low place; English: 9,605^th place)

microsoft.com (Global: 263^rd place; English: 259^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

psu.edu (Global: 299^th place; English: 159^th place)

researchgate.net (Global: 96^th place; English: 89^th place)

rfc-editor.org (Global: 747^th place; English: 325^th place)

sciencedirect.com (Global: 137^th place; English: 146^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

tudelft.nl (Global: 7,254^th place; English: 5,846^th place)

washington.edu (Global: 1,171^st place; English: 736^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)