We present an algorithm for optimal routing in communication networks, resulting in
minimum time and minimum total delay clearing of congested traffic towards a single …

A method commonly used for packet flow control over connections with long round-trip
delays is" sliding windows". In general, for a given loss rate, a larger window size achieves a …

The main purpose of routing and flow control in a communication network is, roughly
speaking, to keep delay per message (ie travel time from origin to destination) within an …

Although delay‐based congestion control protocols such as FAST Transmission Control
Protocol (TCP) promise to deliver better performance than traditional TCP Reno, they have …

ABSTRACT A joint flow control and routing (JFCR) strategy is proposed for store and
forward communication networks. The strategy is based on a convex optimization problem in …

We address the problem of flow control and routing of real-time traflic in a network, where
messages must anive at their destination within given deadlines; otherwise they are …

The occurrence of congestion severely degrades the performance, especially in high-speed
networks with long propagation delay relative to packet transmission time. This is because it …

Congestion is intrinsic to the operation of networks and is usually handled by a combination
of algorithms at the link and network/transport layers. Link level algorithms alleviate" …

The first portion of this paper provides a broad introduction to the various types of routing
and flow control procedures either used or proposed for use at the transport (path control) …

This paper concerns the optimization of data traffic flows on a telecommunication network,
modelled by a fluid-dynamic approach. The flows can be controlled adjusting the traffic …