• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• 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.

• 한국통신학회논문지
• /
• 제21권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.

• ETRI Journal
• /
• 제37권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.

• ETRI Journal
• /
• 제28권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.

• ETRI Journal
• /
• 제34권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.

• 한국콘텐츠학회논문지
• /
• 제12권4호
• /
• pp.69-75
• /
• 2012

본 논문에서는 다양한 서비스의 QoS를 제공하기 위하여 호 수락 제어(Call Admission Control : CAC) 알고리즘에 트래픽 혼잡비를 적용했을 때 평균 데이터 전송율과 평균 패킷 지연시간을 비교 평가하였다. 우선권 기반의 트래픽 혼합비가 1:1:4:4일 때 호 수락 제어 알고리즘을 적용하지 않았을 경우 FTP 서비스는 0.4일 때, 웹 서비스는 0.6일 때, 스트리밍 서비스는 0.7일 때 패킷 지연 요구사항을 만족하지 못하는 것과는 달리 제안하는 호 수락 제어 알고리즘을 적용하였을 경우 성능 평가를 수행한 모든 도착률에 대해 모든 서비스의 패킷지연을 만족함을 보였다. 또한 WWW, FTP, Video, VoIP 서비스를 대상으로 호 수락 제어 알고리즘을 적용하여 트래픽 혼합비 환경에서 서비스의 QoS를 보장할 수 있음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제32권10B호
• /
• pp.613-620
• /
• 2007

현재, 광대역 통합 통신망의 발달로 통신과 방송이 융합된 고품질의 멀티미디어 서비스가 가능해 지고 있다. 이러한 고품질의 통신 방송 융합 서비스는 IP 망에서 신뢰성 있는 멀티캐스팅 메커니즘이 요구되는데 현재의 멀티캐스팅 메커니즘은 end-to-end QoS 보장에 어려운 점이 있다. 이러한 신뢰성이 요구되는 고품질의 IP 멀티미디어 IPTV 서비스를 위해서는 먼저 신뢰성 있는 품질 보장성 멀티캐스팅 메커니즘이 제공되어야 하며 이를 위해 본 논문에서는 중앙 집중 멀티캐스팅 관리 블록의 제어를 받는 프루빙 패킷 기반 멀티캐스팅 수락 제어 메커니즘을 제안하였다. 그리고 ns-2 시뮬레이터를 사용하여 제안된 메커니즘에 대한 성능 분석을 제시하였다.

• 한국정보과학회논문지:정보통신
• /
• 제29권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.

• 한국통신학회논문지
• /
• 제28권2B호
• /
• pp.105-116
• /
• 2003

IP 망에서 차별 서비스 구조는 코아 노드에서 클래스별 서비스 기반의 단순한 모델을 적용한다. 그러나, 이러한 단순 처리로 인하여, 망 구조나 프로비저닝은 더욱 복잡하게 되고 서비스 제공자가 동적 프로비저닝이나 효율적인 대역 보장 방법을 제공하려면 시그널링 프로토콜이나 연결 수락 제어 방법이 제공되어져야 한다. 그러나, 이러한 방법은 망의 복잡성을 증가시키게 됨으로 차별 서비스 망에서 복잡하지 않고 대역을 효율적으로 사용할 수 있는 동적 프로비저닝 기법이 연구되어야 한다. 본 논문에서는 차별 서비스 망에서 다양한 서비스 품질 요구 사항을 만족시킬 수 있는 연결 수락 제어 메커니즘으로 대역폭 브로커와 측정 기반 수락 제어 및 가변 영역 대역 관리 방법을 사용하는 DPM2 (Dynamic Provisioning over MBAC and Movable Boundary) 메커니즘을 제안하였다. 또한, ns-2 시뮬레이터를 이용하여 성능 분석을 하였다.