Filters








1,811 Hits in 4.3 sec

Joint Connection Admission Control and Routing in IEEE 802.16-Based Mesh Networks

S. Zhang, F. R. Yu, V. C. M. Leung
2008 2008 IEEE International Conference on Communications  
Connection admission control and routing are two important mechanisms in the provision of quality of service (QoS) in IEEE 802.16-based wireless mesh networks.  ...  Index Terms-Wireless mesh network, admission control and routing, Markov process.  ...  ACKNOWLEDGMENT We thank the reviewers for their detailed reviews and constructive comments, which have helped to improve the quality of this paper.  ... 
doi:10.1109/icc.2008.925 dblp:conf/icc/ZhangYL08 fatcat:aq64cicn3rbpxhh3noq4xbbb7m

Joint connection admission control and routing in IEEE 802.16-based mesh networks

Shiying Zhang, F. Yu, Victor M. Leung
2010 IEEE Transactions on Wireless Communications  
Connection admission control and routing are two important mechanisms in the provision of quality of service (QoS) in IEEE 802.16-based wireless mesh networks.  ...  Index Terms-Wireless mesh network, admission control and routing, Markov process.  ...  ACKNOWLEDGMENT We thank the reviewers for their detailed reviews and constructive comments, which have helped to improve the quality of this paper.  ... 
doi:10.1109/twc.2010.04.081437 fatcat:bvyhw6vx4bduvg7kzohr2mcgh4

Centralized Congestion Control and Scheduling in a Datacenter [article]

Devavrat Shah, Qiaomin Xie
2017 arXiv   pre-print
Precisely, our policy is an emulation of Store-and-Forward (SFA) congestion control in conjunction with Last-Come-First-Serve Preemptive-Resume (LCFS-PR) scheduling policy.  ...  We consider the problem of designing a packet-level congestion control and scheduling policy for datacenter networks.  ...  The SFA policy has been shown to be insensitive with respect to general service time distributions [43] , and result in a reversible network with Poisson arrival processes [41] .  ... 
arXiv:1710.02548v1 fatcat:ul3qnjrjmvd7vohtazzpkv3mkq

Modelling the performance of distributed admission control for adaptive applications

Alan Bain, Peter Key
2001 Performance Evaluation Review  
In distributed admission control [1, 4, 3] , the end-system or edge-device plays a key role in the admission decision: it probes the network with a small number of packets and decides to enter or not depending  ...  In a network with several resources, a user or route r may use a subset of these resources.  ...  In distributed admission control [1, 4, 3] , the end-system or edge-device plays a key role in the admission decision: it probes the network with a small number of packets and decides to enter or not  ... 
doi:10.1145/507553.507562 fatcat:56zay2773veshhzfl3kivy5344

Fixed Point Approximation for Multirate Multihop Loss Networks With State-Dependent Routing

M. Liu, J.S. Baras
2004 IEEE/ACM Transactions on Networking  
In this paper we consider a class of loss networks that have arbitrary topologies and routes of arbitrary length.  ...  One is the state-dependent nature of the routing mechanism, the other is the possible overlapping between routes due to the general multihop topology of the network.  ...  ACKNOWLEDGMENT The authors would like to thank the associate editor and the anonymous reviewers for their comments in completing the final version of this paper.  ... 
doi:10.1109/tnet.2004.826248 fatcat:tv75wqyz4bgbpl3j6wmbjfoize

User-Centric Network Fairness through Connection-Level Control

Andres Ferragut, Fernando Paganini
2010 2010 Proceedings IEEE INFOCOM  
In the case where connections are generated exogenously by possibly noncooperative users, we develop admission control policies that ensure both network stability and user-centric fairness.  ...  In particular, we develop control laws for the number of connections identified with a certain user, which can include single-path, multipath or more general aggregates of flows, and prove convergence  ...  ACKNOWLEDGMENTS Research supported by AFOSR, US and ANII, Uruguay.  ... 
doi:10.1109/infcom.2010.5462202 dblp:conf/infocom/FerragutP10 fatcat:qvv6yefn5nbwfmqpf7zufcsuyi

Fair bandwidth sharing under flow arrivals/departures

Vladimir Marbukh
2007 Performance Evaluation Review  
The network can be stabilized in a close neighborhood of the metastable state with admission control at the cost of small flow rejection probability.  ...  A flow-level Markov model for fair bandwidth sharing with packet retransmissions and random flow arrivals/departures is proposed.  ...  The network can be stabilized in a close neighborhood of this metastable state with flow admission control at the price of small flow rejection probability.  ... 
doi:10.1145/1330555.1330560 fatcat:l6n3ttxzqzdtbopkcnrxnkq3ia

Leave-in-Time

Norival R. Figueira, Joseph Pasquale
1995 Computer communication review  
We present a set of admission control algorithms which support the ability to do delay shifting in a systematic way.  ...  Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on the probability distribution of end-to-end delays.  ...  Network Topology Our simulations use the network topology of Figure 6 .  ... 
doi:10.1145/217391.217433 fatcat:kwyam7fnyvdpziu6p5mogexgxy

Can TCP metastability explain cascading failures and justify flow admission control in the Internet?

V. Marbukh
2008 2008 International Conference on Telecommunications  
It is possible to eliminate or reduce the possibility of cascading failures with properly designed flow admission control which stabilizes the network in a close neighborhood of the desirable metastable  ...  Cascading failures can be viewed as a process of network transition from desirable metastable mode with finite number of flows in progress to the congested mode.  ...  We assume that files arrive on a route R r ∈ according to a Poisson process of rate streaming flows arrive on route r according to a Poisson process of rate control and routing as well as user dissatisfaction  ... 
doi:10.1109/ictel.2008.4652619 dblp:conf/ict/Marbukh08 fatcat:tzy6zgpn35cifc7seetmvm6hea

Leave-in-Time

Norival R. Figueira, Joseph Pasquale
1995 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '95  
We present a set of admission control algorithms which support the ability to do delay shifting in a systematic way.  ...  Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on the probability distribution of end-to-end delays.  ...  Network Topology Our simulations use the network topology of Figure 6 .  ... 
doi:10.1145/217382.217433 dblp:conf/sigcomm/FigueiraP95 fatcat:3zu2wcmbqzcfpoa5g75uhtawte

Traffic engineering approach to virtual-link provisioning in software-defined ISP networks

Slavica Tomović, Igor Radusinović
2018 Telfor Journal  
The online component handles dynamic arrivals of virtual-link requests in accordance with Service Level Agreements (SLAs) requirements.  ...  The traffic control logic of SDN controller is divided into offline and online component.  ...  Statistics gathering Admission control Online routing Topology info Decision Flow rule generator Route Offline TE Load balancing weights Control plane Application plane SLA  ... 
doi:10.5937/telfor1801014t fatcat:jqlaikpso5btvkmdsgqbyesofu

Evaluating the impact of stale link state on quality-of-service routing

A. Shaikh, J. Rexford, K.G. Shin
2001 IEEE/ACM Transactions on Networking  
Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale link-state information and random fluctuations in traffic load on the routing  ...  This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks.  ...  Impact of non-Poisson arrivals: Figure 6 illustrates the problem with nonminimal routes when connection requests arrive in bursts.  ... 
doi:10.1109/90.917073 fatcat:ymgpuzoverbqddfbvnsoqpcclq

Bounds on the performance of admission control and routing policies for general topology networks with multiple call classes

A. Dasylva, R. Srikant
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
Abstruct-We consider the problem of obtaining non-trivial lower bounds on the the lost revenue under any routing and admission control scheme in a multi-class loss network.  ...  Then, foltowing [16], [5], we nse this single-link bound to obtain linear programs which give bounds in the case of sparsely-comected networks with mrdtiple bandwidtb classes and alternate routing.  ...  Thus, the above problem consists of both admission control and routing.  ... 
doi:10.1109/infcom.1999.751384 dblp:conf/infocom/DasylvaS99 fatcat:ifvpmtxbjfhkrojravcl2qyvfm

Editorial introduction

Venkat Anantharam, Ralph L. Disney, Jean Walrand
1993 Queueing systems  
networks with feedforward routing.  ...  We hope it will have the effect of catalyzing further developments in the area. The papers of Harrison and Nguyen and of Dai and Wang deal with the area of Browniaa models of queueing networks.  ...  Problems of service rate control, routing and admission control and scheduling are discussed.  ... 
doi:10.1007/bf01158926 fatcat:cvr33c7wjbgdpclctchuyiozmu

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows

Su-Wei Tan, Sze-Wei Lee, Benoit Vaillaint
2002 Computer Communications  
This paper presents a new non-greedy routing and admission control algorithm for the dynamic routing of bandwidth-guaranteed tunnels.  ...  It combines the key concepts in the minimum interference routing algorithm and the algorithms developed based on theoretic competitive analysis to provide ef®cient routing.  ...  In Ref. [19] , a non-greedy routing and admission control algorithm called EXP was developed based on the admission control scheme proposed in Ref. [2] .  ... 
doi:10.1016/s0140-3664(02)00055-5 fatcat:hlkgjmriqvg6fmxnxmfl7g5kwy
« Previous Showing results 1 — 15 out of 1,811 results