Optimal control of admission to a queueing system
S Stidham - IEEE Transactions on Automatic Control, 1985 - ieeexplore.ieee.org
Congestion in a queueing system can sometimes be controlled by restricting arrivals, either
by" closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) …
by" closing a gate" or by charging an entrance fee or toll. We review both static (open-loop) …
On the placement of controllers in software-defined-WAN using meta-heuristic approach
Abstract Software Defined Networks (SDN) is a popular modern network technology that
decouples the control logic from the underlying hardware devices. The control logic has …
decouples the control logic from the underlying hardware devices. The control logic has …
A k shortest path algorithm for adaptive routing in communications networks
DM Topkis - IEEE transactions on communications, 1988 - ieeexplore.ieee.org
An efficient and flexible algorithm is presented for finding ak shortest loopless path with
distinct initial links from one node to each other node. Low-order polynomial bounds are …
distinct initial links from one node to each other node. Low-order polynomial bounds are …
Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network
S Bahk, M El Zarki - Conference proceedings on Communications …, 1992 - dl.acm.org
In this paper we describe briefly a dynamic multi-path routing scheme that has been
considered for connection oriented homogeneous high speed networks. The fundamental …
considered for connection oriented homogeneous high speed networks. The fundamental …
Routing and flow control in high-speed wide-area networks
NF Maxemchuk, M El Zarki - Proceedings of the IEEE, 1990 - ieeexplore.ieee.org
The routing and flow control techniques developed for wide-area, local-area, and
metropolitan-area networks are surveyed. A classification that shows the characteristics that …
metropolitan-area networks are surveyed. A classification that shows the characteristics that …
The join-biased-queue rule and its application to routing in computer communication networks
TS Yum, M Schwartz - IEEE Transactions on Communications, 1981 - ieeexplore.ieee.org
A routing rule similar in nature to delta-routing [8] is studied in this paper. The approach is to
superimpose, local adaptivity on top of a fixed traffic flow distribution. The fixed flow …
superimpose, local adaptivity on top of a fixed traffic flow distribution. The fixed flow …
Interactions between routing and flow control algorithms
G Thaker, J Cain - IEEE transactions on communications, 1986 - ieeexplore.ieee.org
In this paper we discuss the interactions between routing and flow control algorithms for
packet-switched networks. We present a new variation on the Gallager-Golestaani flow …
packet-switched networks. We present a new variation on the Gallager-Golestaani flow …
[图书][B] Routing in high-speed networks
RH Hwang - 1993 - search.proquest.com
In the 1990s, significant advances in fiber optic and switching technology have precipitated
the current explosion in the amount of research in future high-speed networks. The …
the current explosion in the amount of research in future high-speed networks. The …
Performance considerations for integrated voice and data networks
J Gruber - Computer Communications, 1981 - Elsevier
Performance considerations, particularly network delays, for integrated voice and data
networks are reviewed. The nature of the delay problem is discussed, followed by a review …
networks are reviewed. The nature of the delay problem is discussed, followed by a review …
MultiRoute-a congestion-aware multipath routing protocol
A Al-Shabibi, B Martin - 2010 International Conference on High …, 2010 - ieeexplore.ieee.org
We propose a novel congestion-aware routing protocol, which leverages local and remote
congestion information for routing decisions. Path congestion is difficult to measure …
congestion information for routing decisions. Path congestion is difficult to measure …