Dynamic SLA management in cellular DiffServ networks

Date

2003-03-01

Author

Akan, OB
Baykal, Buyurman

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

31
views

0
downloads

Minimization of the forced termination probability of active connections during handoff is one of the most important tasks for seamless cellular network operation. Handoff delay minimization is in parallel with this task. This paper introduces a new dynamic SLA management procedure to be used in cellular DiffServ networks. With the Expected Visitor List (EVL) processor deployment at base stations in the shadow duster and pre-messaging among them, virtual call admission control for the incoming mobile is performed in advance. No pre-reservation is performed, and the EVL processing results are stored and kept updated to achieve minimized handoff latency. Efficiency and performance the proposal have been explored via simulation experiments under different scenarios.

Subject Keywords

Cellular networks, Expected visitor list, DiffServ, QoS provisioning, Handoff

URI

https://hdl.handle.net/11511/37212

DOI

https://doi.org/10.1109/ictel.2003.1191247

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A QoS-Aware handoff using RSVP in next generation wireless networks Baykal, Buyurman (2003-07-03) The handoff call blocking probability minimization is an important issue for seamless wireless network operation. Handoff delay minimization is in parallel with this task. Mobile stations with QoS requirements should be able to receive the same service level during and after handoff. This constraint amplifies the handoff latency caused forced termination problem. This research introduces a handoff method, which performs some preparation phase tasks in advance, in wireless networks. With the Expected Visitor...
Predictive mobile-oriented channel reservation schemes in wireless cellular networks Abdulova, Vassilya; Aybay, Isik (2011-01-01) Provision of seamless service to multimedia applications in cellular wireless networks largely depends on the way calls are handled during handoff. Hence, sufficient resources must be provided for handoff (HO) connections when a mobile station (MS) moves from one cell to another. Effective allocation of resources can be achieved when the exact future trajectory of MSs is known in advance. However, such a scenario is unrealistic. The next best possibility is to employ user mobility prediction to determine th...
Machine learning algorithms for accurate flow-based network traffic classification: Evaluation and comparison Soysal, Murat; Schmidt, Şenan Ece (Elsevier BV, 2010-06-01) The task of network management and monitoring relies on an accurate characterization of network traffic generated by different applications and network protocols. We employ three supervised machine learning (ML) algorithms, Bayesian Networks, Decision Trees and Multilayer Perceptrons for the flow-based classification of six different types of Internet traffic including peer-to-peer (P2P) and content delivery (Akamai) traffic. The dependency of the traffic classification performance on the amount and composi...
A simulation study of scheduling algorithms for packet switching networks Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003) A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
Mobility and Queue Based Guard Channel Scheme for Cellular Networks Candan, Idil (2014-05-14) This paper presents a dynamic and queue based bandwidth allocation scheme for cellular networks. According to mobility values, the bandwidth threshold is dynamically changed and a queuing policy is used for newly originating calls. If the number of busy bandwidth units is greater than or equal to bandwidth threshold, the arriving new calls are queued. The results indicate that, our scheme outperforms other proposed scheme in terms of handoff dropping, new call blocking probabilities and utilization, and als...

Citation Formats

O. Akan and B. Baykal, “Dynamic SLA management in cellular DiffServ networks,” 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37212.