Data networks
A unified approach to bandwidth allocation and access control in fast packet-switched networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
G-networks with multiple classes of negative and positive customers
Theoretical Computer Science
Diffusion based statistical call admission control in ATM
Performance Evaluation
A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Admission of QoS aware users in a smart network
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Random neural networks with synchronized interactions
Neural Computation
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
The Computer Journal
Analysis and Synthesis of Computer Systems: Texts)
Analysis and Synthesis of Computer Systems: Texts)
A Framework for Energy-Aware Routing in Packet Networks
The Computer Journal
Advances in internet congestion control
IEEE Communications Surveys & Tutorials
MPLS advantages for traffic engineering
IEEE Communications Magazine
A survey on TCP-friendly congestion control
IEEE Network: The Magazine of Global Internetworking
An M/G/1 retrial G-queue with non-exhaustive random vacations and an unreliable server
Computers & Mathematics with Applications
Modeling and optimizing Random Walk content discovery protocol over mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
The aim of this paper is to detail a control scheme for packet computer networks whose purpose is to minimise a quality-of-service oriented performance metric by re-routing the traffic. The model is based on G-networks with triggered customer movement to represent traffic re-routing, and on a gradient descent based optimisation algorithm. The model and the algorithm are presented and we show that the gradient descent algorithm is of computational complexity O(N^3) where N is the number of nodes in the packet network. Via the use of multiple classes of normal traffic and multiple classes of triggers, our approach allows one not only to evaluate the effect of the control, but also to incorporate the overhead that the control traffic will induce, and the consequences of the delays or possible losses of the control traffic. Similarly, these effects will naturally be incorporated when one considers both the impact of the control traffic on the cost function, and the details of this control traffic in the control algorithm itself.