
The paper reviews current algorithms for distributed, asynchronous control of networks when the customer is guaranteed to get some predetermined (e.g., as a part of a service level agreement – SLA) values of flow. Two cases are considered – both with single and multiple commodity. It is assumed, that the flow cost functions are convex with special attention devoted to linear and strictly convex cases
asynchronous algorithms, routing, quality of service, Telecommunication, service level agreement, computer networks, TK5101-6720, Information technology, T58.5-58.64, distributed optimization
asynchronous algorithms, routing, quality of service, Telecommunication, service level agreement, computer networks, TK5101-6720, Information technology, T58.5-58.64, distributed optimization
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
