• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.434-434
• /
• 1995

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.94-97
• /
• 1999

In this paper, a new real-time neural network connection admission controller is proposed. The proposed controller measures traffic flows, cell loss rate and cell delay periodically each classes. The Neural network learns the relation between those measured information and service quality by real-time. Also the proposed controller uses the DWRR multiplexer with buffer dedicated to every traffic source in order to measure the delay that cells experience in buffer. Experimental result shows that the proposed method can control effectively heterogeneous traffic sources with diverse QoS requirement.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.173-180
• /
• 2002

The virtual cell loss rate was introduced for the training pattern of the neural network in the VOB(Virtual Output Buffer) model. The VOB model shows that the neural network can find the connection admission boundary without the real cell loss rate. But the VOB model tends to overestimate the cell loss rate, so the utilization of network is low. In this paper, we uses the reference curve of the cell loss rate, which contains the information about the cell loss rate at the connection admission boundary. We process the patterns of the virtual cell loss rate using the reference curve, We performed the simulation with two major ATM traffic classes. One is On-Off traffic class that has the traffic characteristic of LAN data and other is Auto-Regressive traffic class that has the traffic characteristic of a video image communication.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.311-318
• /
• 2001

본 논문에서는 연결수락 제어시 사용자가 전송하는 트래픽 파라메타(샐 개수의 분산값과 평균값)를 압축하여 망에 신고하는 방법을 제안하고, 압축방법에 의한 연결수락제어의 성능을 분석 비교한다. 트래픽 파라메타 압축방법은 K-means, CL(Competitive Learning), Fuzzy ISODATA,FNC(Fuzzy Neural Clustering)를 사용한다. 제안한 트래픽 파라메타의 압축에 의한 연결수락제어는 퍼지 매핑함수(Fuzzy Mapping Funciton)fp 의해 신고한 트래픽 패턴을 추정하고, 전방향 구조의 신경망을 사용하여 연결의 수락/거절을 결정한다. ON-OFF 트래픽 모델 환경에서 컴퓨터 실험을 통하여 여러 가지 압축방법들을 사용한 연결수락제어의 성능을 Fuzziness 값에 따라 비교하였고, 그 결과 FNC 방법이 우수함을 알 수 있었다. EH한 연결수락제어의 성능을 높히기 위해서 관측 프레임의 셀 분산값이 크면 Fuzziness 값을 작게 선정하고, 작으면 상대적으로 크게 선정해야 함을 알 수 있었다.

• Journal of Advanced Navigation Technology
• /
• v.17 no.4
• /
• pp.435-441
• /
• 2013

This paper proposes a neural net based-predictive connection admission control (CAC) scheme for multiclass users in wireless cognitive radio networks. We classifies cognitive users(cu) into real and non real time services, and then permit only real time services to reserve the demanded resource for spectrum handoff in guard channel for provisioning the desired QoS. Neural net is employed to predict primary user's arrival on time and demanded channels. Resource scheduling scheme is based on $C_IA$(cognitive user I complete access) shown in this paper. For keeping primary users from interference, the CAC is performed on only cognitive user not primary user. Simulation results show that our schemes can guarantee the desired QoS by cognitive real time services.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.70-80
• /
• 2007

For supporting various mobile networks, this paper proposes a framework of distributed connection admission control, named SmartCAC. Especially, intelligent CAC operations are adopted in terms of interoperation between mobile nodes and mobile networks. This scheme does not need to correct information between networks. Basically vertical handover call can use guard channel that was reserved for handoff, because SmartCAC addresses the identification between vertical handover call and new call, delay and reliability as requirement of QoS for efficient connection control. The scheme also uses mobile terminal speed for network filtering. Especially an extended protocol is proposed to give different network states information to mobile nodes because there have been no ways for mobile nodes to compare the states of different networks. Sophisticated simulation study is performed in order to evaluate SmartCAC in terms of signaling cost. As a result, signaling cost of ours is up to 96% better than that of the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1421-1425
• /
• 1999

A restoration scheme is presented when a failure occurs at nodes or links on the ATM network. Each node on the network contains the same topology information for resources on the network by Exchanging NSE(Network State Element) which has the network state information through RCC(Routing Control Channel). We also propose a new establishing algorithm that set up a new alternate path reflecting the state of the network changed dynamically at the source node. In the result of applying our scheme, the rates of restoration can be improved and the number of messages decreased so that fast recovering could be possible by reducing traffics on the network by lowering the rates of the call-setup failure at the stage of CAC(Connection Admission Control).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.75-89
• /
• 2003

Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1719-1729
• /
• 1994

In this paper, an adaptive CAC(Connection Admission Control) method is proposed. The adaptive CAC uses traffic estimates derived from both traffic parameter specified by user and cell flow measurements. Traffic estimation using user-specified parameters is performed at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. Traffic estimation using cell flow measurement is carried out when the number of connected calls does not change during a measurement reflection period-renewal period. The most import ant thing for the traffic estimation using cell flow measurement is the determination of the length of a renewal period to trace a real traffic flow with an allowable time lag and the measurement reflection ratio(MRR) both to reduce the portion of overestimation and to avoid underestimation of real traffic flow. To solve these problems, the adaptive CAC updates renewal period and MRR adaptively according to the number of connections and the elapsed time after last connection or release respectively. Performance analysis for the proposed method is evaluated in several aspects for the cases of both homogeneous and heterogeneous bursty traffic. Numerical examples show the adaptive CAC method has the better performance compared with conventional CAC method based on burst model from the both utilization and QOS point of view.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.179-182
• /
• 1991

In this paper, we survey traffic control issues for the B-ISDN based on the ATM. We first investigate traffic descriptors to represent the characteristics of various ATM traffics in a standardized form. Also, we examine key issues related to the connection admission control, usage parameter control, network parameter control, priority control, and congestion control.