G Stassinopoulos… - IEEE transactions on …, 1985 - ieeexplore.ieee.org
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 …
L Libman, A Orda - … . Twenty-second Annual Joint Conference of …, 2003 - ieeexplore.ieee.org
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 delivery of latency sensitive packets is a crucial issue in real-time applications of communication networks. Such packets often have a firm deadline and a packet becomes …
R Adler, Y Azar - Journal of Scheduling, 2003 - Springer
We consider the maximum disjoint paths problem and its generalization, the call control problem, in the on-line setting. In the maximum disjoint paths problem, we are given a …
We consider the maximum disjoint paths problem and its generalization, the call control problem, in the on-line setting. In the maximum disjoint paths problem, we are given a …
Computing network paths under worst-case delay constraints has been the subject of abundant literature in the past two decades. Assuming weighted fair queueing scheduling at …
In this paper we study the problem of on-linecall controlin a communication network, namely, the problem of accepting or rejecting an incoming call (a request for a connection between …
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 issues related to preventing traffic analysis in computer networks used for real time mission-critical applications. We consider an IP-based network where headers of …