We propose a new way for evaluating the performance of packet switching communication networks under a fixed (session based) routing strategy. Our approach is based on properly bounding the probability distribution functions of the system input processes. The bounds we suggest, which are decaying exponentials, possess three convenient properties: When the inputs to an isolated network element are all bounded, they result in bounded outputs, and assure that the delays and queues in this element have exponentially decaying distributions; In some network settings bounded inputs result in bounded outputs; Natural traffic processes can be shown to satisfy such bounds. Consequently, our method enables the analysis of various previously intractabl...
International audienceIn this paper, flow models of networks without congestion control are consider...
Networks of Erlang loss queues naturally arise when modelling finite communication systems without d...
One of the key performance measures in queueing systems is the exponential decay rate of the steady-...
There has been a lot of interest in recent times on the performance analysis of routing algorithms f...
We study the stability and the capacity problems in packetized wireless networks. Communication medi...
In this paper, we analyze the behavior of communication networks in which packets are generated dyna...
In this paper, we refine the calculus proposed in [5, 8, 91. The new calculus, including network ope...
[[abstract]]We present two types of stability problems: 1) conditions for queueing networks that ren...
A packet-switching network is stable if the number of packets in the network remains bounded at all ...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers-We present two types of stabili...
Rate allocation among a fixed set of end-to-end connections in the Internet is carried out by conges...
In this paper, we re ne the calculus proposed in [5, 8, 9]. The new calculus, including network ope...
[[abstract]]n this paper, we refine the calculus proposed previously by Chang et al. (1994). The new...
During the past two decades the Internet has been widely deployed and integrated into the society, r...
Following our first paper of stabilizing a Linear Time Invariant (LTI) system in a packet-based net...
International audienceIn this paper, flow models of networks without congestion control are consider...
Networks of Erlang loss queues naturally arise when modelling finite communication systems without d...
One of the key performance measures in queueing systems is the exponential decay rate of the steady-...
There has been a lot of interest in recent times on the performance analysis of routing algorithms f...
We study the stability and the capacity problems in packetized wireless networks. Communication medi...
In this paper, we analyze the behavior of communication networks in which packets are generated dyna...
In this paper, we refine the calculus proposed in [5, 8, 91. The new calculus, including network ope...
[[abstract]]We present two types of stability problems: 1) conditions for queueing networks that ren...
A packet-switching network is stable if the number of packets in the network remains bounded at all ...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers-We present two types of stabili...
Rate allocation among a fixed set of end-to-end connections in the Internet is carried out by conges...
In this paper, we re ne the calculus proposed in [5, 8, 9]. The new calculus, including network ope...
[[abstract]]n this paper, we refine the calculus proposed previously by Chang et al. (1994). The new...
During the past two decades the Internet has been widely deployed and integrated into the society, r...
Following our first paper of stabilizing a Linear Time Invariant (LTI) system in a packet-based net...
International audienceIn this paper, flow models of networks without congestion control are consider...
Networks of Erlang loss queues naturally arise when modelling finite communication systems without d...
One of the key performance measures in queueing systems is the exponential decay rate of the steady-...