• Title/Summary/Keyword: Admission control

Search Result 567, Processing Time 0.03 seconds

Call Admission Control Algorithm Based on Dynamic-Price in Communication Networks (통신망에서의 동적 과금 기반의 호수락 제어 알고리즘)

  • Gong, Seong-Lyong;Lee, Jang-Won
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.163-164
    • /
    • 2008
  • In this paper, we study a dynamic price-based call admission control algorithm for communication networks. When a call arrives at the network, the network calculates the price for the call such that its expected revenue is maximized. The optimal price is dynamically adjusted based on some information of the call, and the congestion level of the network. If the call accept the price, it is admitted. Otherwise, it is rejected. Simulation results show that our dynamic pricing algorithm provides higher call admission ratio and lower price than the static algorithm [1][2], even though they provide almost the same revenue.

  • PDF

ATM call admission control based on a neural network for multiple service traffics (다중 서비스 트래픽을 위한 신경회로망 기반의 ATM 호 수락 제어)

  • 이두헌;신요안;김영한
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.1958-1969
    • /
    • 1996
  • This paper proposed a new approach to adaptive call admission control based on a neural network for multiple service classes with different quality of service (QoS) in the ATM-based Broadband Integrated Services Digital Networks. the proposed method extend Hiramatsu's neural network based "leaky pattern table" method for the single QoS[1, 2, 3] to deal with multiple services with different QoS by constructing multiple pattern tables based on each service's acceptance or rejection at the call set-up requests, and by simultaneously controlling each service's QoS according to the target QoS of the service and the trunk capacity. Computer simulation results on two service classes with different traffic characteristics and different cell loss rates as QoS, highlight good performance and effectiveness of the proposed call admission controller for multiple service classes.e classes.

  • PDF

Optimal Admission Control and State Space Reduction in Two-Class Preemptive Loss Systems

  • Kim, Bara;Ko, Sung-Seok
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.917-921
    • /
    • 2015
  • We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

Effective Admission Policy for Multimedia Traffic Connections over Satellite DVB-RCS Network

  • Pace, Pasquale;Aloi, Gianluca
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.593-606
    • /
    • 2006
  • Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next-generation internet. As a result, issues concerning the designing and testing of efficient connection-admission-control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital-video-broadcasting return-channel-via-satellite (DVB-RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real-time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well-known iterative CAC mainly designed for the managing of real-time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real-time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real-time multimedia traffic sources in high load and mixed traffic conditions.

  • PDF

Multicore Flow Processor with Wire-Speed Flow Admission Control

  • Doo, Kyeong-Hwan;Yoon, Bin-Yeong;Lee, Bhum-Cheol;Lee, Soon-Seok;Han, Man Soo;Kim, Whan-Woo
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.827-837
    • /
    • 2012
  • We propose a flow admission control (FAC) for setting up a wire-speed connection for new flows based on their negotiated bandwidth. It also terminates a flow that does not have a packet transmitted within a certain period determined by the users. The FAC can be used to provide a reliable transmission of user datagram and transmission control protocol applications. If the period of flows can be set to a short time period, we can monitor active flows that carry a packet over networks during the flow period. Such powerful flow management can also be applied to security systems to detect a denial-of-service attack. We implement a network processor called a flow management network processor (FMNP), which is the second generation of the device that supports FAC. It has forty reduced instruction set computer core processors optimized for packet processing. It is fabricated in 65-nm CMOS technology and has a 40-Gbps process performance. We prove that a flow router equipped with an FMNP is better than legacy systems in terms of throughput and packet loss.

QoS Improvement Analysis Call Admission Control(CAC) Algorithm based on 3GPP PBNM (3GPP 정책기반에서 호 수락 제어(CAC) 알고리즘 적용에 따른 QoS 성능개선)

  • Song, Bok-Sob;Wen, Zheng-Zhu;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.69-75
    • /
    • 2012
  • In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

Defending HTTP Web Servers against DDoS Attacks through Busy Period-based Attack Flow Detection

  • Nam, Seung Yeob;Djuraev, Sirojiddin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2512-2531
    • /
    • 2014
  • We propose a new Distributed Denial of Service (DDoS) defense mechanism that protects http web servers from application-level DDoS attacks based on the two methodologies: whitelist-based admission control and busy period-based attack flow detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. The stress is measured by the time interval during which a given client makes the server busy, referred to as a client-induced server busy period (CSBP). We also need to protect the servers from a sudden surge of attack flows even before the malicious flows are identified by the attack flow detection mechanism. Thus, we use whitelist-based admission control mechanism additionally to control the load on the servers. We evaluate the performance of the proposed scheme via simulation and experiment. The simulation results show that our defense system can mitigate DDoS attacks effectively even under a large number of attack flows, on the order of thousands, and the experiment results show that our defense system deployed on a linux machine is sufficiently lightweight to handle packets arriving at a rate close to the link rate.

A Study on Probing based Multicasting Admission Control Mechanism for IP Multimedia Service (IP 멀티미디어 서비스를 위한 Probing 기반 멀티캐스팅 수락 제어 메커니즘 연구)

  • Rhee, Woo-Seop;Yoo, Whan-Seok;Lee, Soon-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10B
    • /
    • pp.613-620
    • /
    • 2007
  • Recently, due to the developing of broadband convergence networks, the high quality multimedia services which are converged with communication and broadcasting can be provided. These high quality communication and broadcasting convergence service needs reliable multicasting mechanism in IP networks. However, multicasting mechanism recently deployed is difficult to guarantee the end-to-end QoS. For the reliable high quality If multimedia IPTV service, the QoS guaranteed multicasting mechanism should be provided. Therefore, we proposed a probing packet based multicasting admission control mechanism using centralized multicasting control management block in this paper. And for the performance evaluation of the proposed mechanism, we used ns-2 simulator.

A Practical Connection Admission Control Scheme in ATM Networks (ATM망에서 실용적 연결수락제어 기법)

  • Kang, Koo-Hong;Park, Sang-Jo
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.181-187
    • /
    • 2002
  • Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

A Study on Dynamic Provisioning Mechanism for QoS guarantee in DiffServ Networks (DiffServ 망에서 QoS 보장을 위한 동적 프로비저닝 메카니즘 연구)

  • Rhee, Woo-Seop;Lee, Jun-Hwa;Yang, Mi-Jeong;Lee, Il-Woo;Yu, Jae-Hoon;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.105-116
    • /
    • 2003
  • The differentiated service architecture is based on a simple model by applying a per-class service in the core node of the network. However, due to the simplified network behavior, the network structure and provisioning were more complicated. If a service provider wants the dynamic provisioning or better bandwidth guarantee, signaling protocol with QoS parameters or admission control method should be deployed in DiffServ network. However, these methods increase the complexity. Therefore, we proposed DPM2 mechanism for admission control in the DiffServ network. In this paper, we describe and survey the admission control methods that are applicable to IP networks and propose also the dynamic provisioning mechanism based on the bandwidth broker and distributed measurement based admission control and movable boundary bandwidth management to support heterogeneous QoS services in differentiated service networks. For the performance evaluation for proposed mechanism, we used ns-2 simulator.