• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.441-447
• /
• 2003

Recently there is a growing Interest In mobile cellula r network providing multimedia service. However, the link bandwidth of mobile cellular network is not sufficient enough to provide satisfactory services to use rs. To overcome this problem, an adaptive framework has been proposed in this study, we propose a new method of estimating DPR(degradation period ratio) in an adaptive multimedia network where the bandwidth of ongoing call can be dynamically adjusted during its lifetime. DPR is a QoS(quality of service) parameter which represents the ratio of allocated bandwidth below a pre-defined target to the whole service time of a call. We improve estimation method of DPR using DTMC(discrete time Markov chain) model. We also calculate mean degradation period and degradation probability more precisely than in existing studies. Under Threshold CAC(call admission control) algorithm, we present analytically how to guarantee QoS to users and illustrate the method by numerical examples. The proposed method is expected to be used as one of CAC schemes in guaranteeing predefined QoS level of DPR

• 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 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 Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.18-26
• /
• 2003

In this paper, we design and implement a QoS control function in the SIP-based VoIP system. As a network infrastructure for VoIP service, we select the Intserv over Diffserv architecture where the network resources are managed by a call admission control mechanism. The SIP protocol extended to support QoS signaling procedure is modulized to operate independently with the infrastructure. The performance of the QoS-enabled VoIP system is verified by experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.675-683
• /
• 1996

CAC, UPC, NPC, cell level QoS and congestion control is required to assign efficiently channels's BW and to prevent networks from congestion. In the CAC algorithm, each user defines characteristics of input traffic when channels are set up and network based on this parameters determines the acception or rejection of the required BW. The CAC control mechanism is classified into the centralized BW allocation mechanism and the distributed BW Allocation mechanism according to the function and position of CAC processor allocating BW. In this paper, in contrast with esisted the distributed BW allocation mechanism which assumes the required BW of input traffic as constant, we assume input traffic & serices as bulk probability distribution in order to analyze performance more precisely.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.3
• /
• pp.111-118
• /
• 2006

This paper presents design and development of a simulator evaluates the performance of a hierarchical cellular system. The proposed hierarchical cellular simulator, consisting of macro, micro, and pico cells, applies the wrap-around technique to reduce simulation time. The simulator is implemented as object oriented class models by using the C++ language in a PC environment. The resulting application can evaluate the interference, SIR(Signal to Interference Ratio), and capacity of a hierarchical cellular system in various configurations. Moreover, it can be used in other applications such as power control, call admission control, hand over scheme.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.299-313
• /
• 2002

Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.