• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1701-1713
• /
• 1993

This paper proposes a simple and highly effective RACMC(Real-time ATM Cell Monitoring and Control) algorithm and the resulting bandwidth gain effects art considered. RACMC algorithm performs usage parameter controls according to the monitoring informations of input data cells generated from the accepted connections and the controlling informations set by the M/P(Management Plane) for that connection. The results of monitoring and controlling actions for ATM data cells are transmitted to the M/P and the control parameters in lookup table are updated according to the condition of currently used bandwith. Therefore, the proposed algorithm can allocate network resource optimally and solve the several tantalizing problems that the existing cell control algorithm have, that is, the difficulty in controlling as monitoring very bursty traffics, unavoidable processing delay, and limited input buffer size when implemented. By the performance analysis using computer simulation, RACMC algorithm proves to be very effective especially in ATM network as implemented simply.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.270-277
• /
• 2006

In the wireless adaptive modulation and coding(AMC) systems, the modulation type of user's connection can be changed dynamically. and the ongoing connection might fail due to the change of modulation. In this paper, we approach the AMC-induced CAC problem by focusing on the guaranteed connection. Three kinds of calls, new, handoff, and modulation-changed calls, are considered. We propose a modified guard channel CAC scheme that allows the modulation-changed and handoff calls to use the guard channel. Then we analyze a Markov model for the CAC scheme with long-term AMC in mind. According to the simulation results, the proposed approach reduces the call dropping probability for modulation-changed calls, which suggests the threshold of guard channels can be determined based on the proposed approach.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.51-55
• /
• 2008

Request High-Images, High-quality, duplex transmission, BcN Voice telephone, Broadcast, Data internet service came to be all possible and demolished original communication service area. Also, The quality is guaranteed stablely to new business and ISP the requirement comes to become a multicasting quality guarantee mechanism which there is the reliability for a information communication and High-quality multimedia service. Like this, a multicast mechanism to be guaranteed must become air control End-to-End QoS for a service supply, a transmission delay a packet loss or requirement which the user requests guarantee and multicast Path-NET which there is the reliability must be provided. Therefor, we proposed IP base multicast new join the present the multicast mechanism of Probing packet foundation which there is the efficiently a linking acceptance, we used ns-2 simulator for the performance evaluation of the proposed.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.283-292
• /
• 2002

This paper develops a scheme of resource management for guaranteeing QoS of realtime traffic in wireless mobile internet environments Mobile terminal has significant impact on the QoS originating mobility provided to a real-time application. The currently proposed MRSVP is not clear the boundary of resource reservation tregion and also can give rise to signal overhead to maintain sessions. To solve above problem, we propose the new reservation protocol, mobile cluster based H-MRSVP to combine MRSVP with moving cluster concept. In this paper, we analytically design our model for guaranteeing the QoS of realtime traffic and compare the three schemes: guard channel allocation schemes, DCA and our model. The performance measures are the probabilities of new call blocking, handoff dropping, resource utilization and service completion versus the system offered Erlang load. Consequently, Simulation indicate our model is more flexible than DCA in a view pint of channel utilization and gains the advantage over guard channel scheme with respects to the mobility.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.4
• /
• pp.1-9
• /
• 2015

This paper proposes CAC method that is more efficient for RRM using game theory combined with Multiple Attribute Decision Making(MADM). Because users request services with different Quality of Service(QoS), the network preference values to alternative networks for each service are calculated by MADM methods such as Grey Relational Analysis(GRA), Simple Additive Weighting(SAW) and Technique for Order Preference by Similarity to Ideal Solution(TOPSIS). According to a utility function representing preference value, non-cooperative game is played, and then network provider select the requested service that provide maximum payoff. The appropriate service is selected through Nash Equilibrium that is the solution of game and the game is played repeated. We analyze two overlaid networks among four Wireless LAN(WLAN) systems with different properties. Simulation results show that proposed MADM techniques have same outcomes for every game round.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2184-2196
• /
• 1998

Admission control is one of the most important congestion control mechanism to be executed at the call set up phase by regulating traffic into a network in a preventive way. An efficient QOS evaluation or bandwidth estimation method is required for call admission to be decided in real time. In this paper, we spropose a computtionally simple approximation method of estimating cell loss probability and mean cell delay for admission control of both delay sensitive and loss sensitive calls. Mixed input queueing system, where a new call combines with the existing traffic, is used as a queueing model for QOS estimation. Also traffic parameters are suggested to characterize both a new call and existing traffic. Aggregate traffic is approximated by a renewal process with these traffic parameters and then mean delay and cell loss probability are detemined using appropriate approximation formulas. The accuracy of this approximation approach is examined by comparing their results with exact analysis or simulation results of vrious mixed unput queueing systems. Based on this QOS estimation method, call admission control scheme which is traffic independent and computable in yeal time are proposed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.173-179
• /
• 1998

This paper proposes a new call admission control scheme utilizing an inverse fuzzy vector quantizer(IFVQ) and neural net, which combines benefits of IFVQ and flexibilities of FCM(Fuzzy-C-Menas) arithmatics, to decide whether a requested call that is not trained in learning phase to be connected or not. The system generates the estimated traffic pattern of the cell stream of a new call, using feasible/infeasible patterns in codebook, fuzzy membership values that represent the degree to which each pattern of codebook matches input pattern, and FCM arithmatics. The input to the NN is the vector consisted of traffic parameters which is the means and variances of the number of cells arriving inthe interval. After training(using error back propagation algorithm), when the NN is used for decision making, the decision as to whether to accept or reject a new call depends on whether the output is greater or less then decision threshold(+0.5). This method is a new technique for call admi sion control using the membership values as traffic parameter which declared to CAC at the call set up stage, and is valid for a very general traffic model in which the calls of a stream can belong to an unlimited number of traffic classes. Through the simmulation. it is founded the performance of the suggested method outforms compared to the conventional NN method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1512-1520
• /
• 2000

The wireless communication network is evolving toward IMT-2000 for providing various multimedia services. In order to accomplish this ultimate goal the effective schemes are required which can dynamically utilize the limited wireless resources based on different traffic characteristics of various services. This paper proposes a novel bandwidth allocation and call admission control scheme to transmit multimedia traffic based on the bandwidth reservation procedure using direction estimation in the IMT-2000 This scheme estimates the position of mobiles based on the mliticriteria decision making in which uncertain parameters such as RSS(Received Signal Strength), the distance between mobile and base station the moving direction and the previous location are participated in the decision process using aggregation function in fuzzy set theory. Its effectiveness is investigated by simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1804-1820
• /
• 1997

In this paper, an efficient call control procedure is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queueing network. This procedure is based on a new scheme called as the cell clustering. When we use the cell clustering scheme, at the time that a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistically hand over and by assigning to the call a collection of virtual paths between the base stations. Within a microcell/picocell environment, it is seen that the cell clustering can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, overload condition occurs in which the number of calls to be handled by one base station to exceed that cell site's capacity of radio channel. When an overload condition happens, the quality of service is abruptly degraded. We refer to this as the overload state and in order to quantify the degree of degradation we define two metrics, the probability of overload and the normalized average time spent in the overload state. By using the open network queueing model, we derive closed form expressions for the maximum number of calls that can be admitted into the virtual cell such that the two defined metrics are used as the acceptance criteria for call admission control.

• Journal of the Korea Society for Simulation
• /
• v.20 no.1
• /
• pp.107-116
• /
• 2011

Recently, femtocell has been concerned as one of effective solutions to relieve shadow region and provide high quality services to users in indoor environments. Even though femtocell offers various benefits to cellular operators and users, many technical issues, such as interference coordination, network synchronization, self-configuration, self-optimization, and so on, should be solved to deploy the femtocell in current network. In this paper, we develop a simulator for evaluating performance of long term evolution (LTE) femtocell systems under various interference scenarios. The simulator consists of a main-module and five sub-modules. The main-module connects and manages five sub-modules which have the functionality managing user mobility, packet scheduling, call admission control, traffic generation, and modulation and coding scheme (MCS). To provide user convenience, the simulator adopts graphical user interface (GUI) which can observes simulation results in real time. We expect that this simulator can contribute to developing effective femtocell systems by supporting a tool for analyzing the effect of interference between macrocell and femtocell.