Distributed asynchronous algorithms in the Internet – new routing and traffic control methods

Authors

  • Andrzej Karbowski

DOI:

https://doi.org/10.26636/jtit.2005.3.328

Keywords:

computer networks, optimization, shortest path, traffic control, decomposition, distributed computations, asynchronous algorithms

Abstract

The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms – label correcting and auction algorithms – are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested.

Downloads

Download data is not yet available.

Downloads

Published

2005-09-30

Issue

No. 3 (2005)

Section

ARTICLES FROM THIS ISSUE

License

Copyright (c) 2005 Journal of Telecommunications and Information Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
A. Karbowski, “Distributed asynchronous algorithms in the Internet – new routing and traffic control methods”, JTIT, vol. 21, no. 3, pp. 29–36, Sep. 2005, doi: 10.26636/jtit.2005.3.328.