Open shortest path first routing under random early detection

E-ISSN： 1097-0037|71|2|120-135

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.71, Iss.2, 2018-03, pp. : 120-135

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the complexity of equal shortest path routing

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 344-352

John Wiley & Sons Inc

Access to resources Recommend Favorite

Worst Case Bounds for Shortest Path Interval Routing

By Gavoille C. Guevremont E.

Journal of Algorithms, Vol. 27, Iss. 1, 1998-04 ,pp. : 1-25

Academic Press

Access to resources Recommend Favorite

The shortest path improvement problems under Hamming distance

By Zhang Binwu Zhang Jianzhong Qi Liqun

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 351-361

Springer Publishing Company

Access to resources Recommend Favorite

Robust constrained shortest path problems under budgeted uncertainty

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. : 98-111

John Wiley & Sons Inc

Access to resources Recommend Favorite

Geodiverse routing with path delay and skew requirement under area‐based challenges

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 4, 2015-12 ,pp. : 335-346

John Wiley & Sons Inc

Access to resources Recommend Favorite