• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.27-30
• /
• 2000

In this paper, we propose a new dynamic bandwidth allocation and call admission control method for the VBR video sources with QoS constraints to provide user's quality of service requirements and at the same time to achieve an efficient resource management in networks. The proposed mechanism dynamically adjusts the necessary bandwidth by the networks based on the provided quality of service satisfaction degree of each connection in respect to the user's requirements in terms of loss ratio and average delay Simulation results show that our proposed dynamic method is able to provide the desired level of quality of service and high utilization.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1880-1893
• /
• 1996

In this paper, we propose the fuzzy traffic control method in ABR service for the effective use of ATM link. This method, a modified version of EPRCA which is one of rate control methods in ABR service, controls the values of the transmission rates of source by using the fuzzy traffic inference based on switch buffer size and buffer variate rate. For this method, we developed a model and algorithm of the fuzzy traffic control method and a fuzzy traffic controller, after studying fuzzy and neural networks which applied to ATM traffic control and EPRCA. For the fuzzy traffic controller, we also designed a membership function, fuzzy control rules and a max-min inferencing method. We conducted a simulation and compared the link utilization of the fuzzy traffic control method with that of the EPRCA method. The results of the simulation indicated that, compared to EPRCA, the fuzzy traffic control method improves the link utilization by 2.3% in a normal distribution model and by 2.7% in the MMPP model of the source.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3701-3727
• /
• 2016

Recently Service Function Chaining (SFC) is promising to innovate the network service mode in modern networks. However, a feasible implementation of SFC is still difficult due to the need to achieve functional equivalence with traditional modes without sacrificing performance or increasing network complexity. In this paper, we present a configurable network service chaining (CNSC) mechanism to provide services for network traffics in a flexible and optimal way. Firstly, we formulate the problem of network service chaining and design an effective service chain construction framework based on integrating software-defined networking (SDN) with network functions virtualization (NFV). Then, we model the service path computation problem as an integer liner optimization problem and propose an algorithm named SPCM to cooperatively combine service function instances with a network utility maximum policy. In the procedure of SPCM, we achieve the service node mapping by defining a service capacity matrix for substrate nodes, and work out the optimal link mapping policies with segment routing. Finally, the simulation results indicate that the average request acceptance ratio and resources utilization ratio can reach above 85% and 75% by our SPCM algorithm, respectively. Upon the prototype system, it is demonstrated that CNSC outperforms other approaches and can provide flexible and scalable network services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1398-1417
• /
• 2013

A method is proposed to reduce excess resources from a virtual machine(VM) while avoiding subsequent migrations for a computer cluster that provides cloud service. The proposed scheme cuts down on the resources of a VM based on the probability that migration may occur after a reduction. First, it finds a VM that can be scaled down by analyzing the history of the resource usage. Then, the migration probability is calculated as a function of the VM resource usage trend and the trend error. Finally, the amount of resources needed to eliminate from an underutilized VM is determined such that the migration probability after the resource reduction is less than or equal to an acceptable migration probability. The acceptable migration probability, to be set by the cloud service provider, is a criterion to assign a weight to the resource reduction either to prevent VM migrations or to enhance VM utilization. The results of simulation show that the proposed scheme lowers migration frequency by 31.6~60.8% depending on the consistency of resource demand while losing VM utilization by 9.1~21.5% compared to other known approaches, such as the static and the prediction-based methods. It is also verified that the proposed scheme extends the elapsed time before the first occurrence of migration after resource reduction 1.1~2.3-fold. In addition, changes in migration frequency and VM utilization are analyzed with varying acceptable migration probabilities and the consistency of resource demand patterns. It is expected that the analysis results can help service providers choose a right value of the acceptable migration probability under various environments having different migration costs and operational costs.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.311-319
• /
• 2006

This paper presents a terminal-assisted frame-based packet reservation multiple access (TAF-PRMA) protocol, which optimizes random access control between heterogeneous traffic aiming at more efficient voice/data integrated services in dynamic reservation TDMA-based broadband access networks. In order to achieve a differentiated quality-of-service (QoS) guarantee for individual service plus maximal system resource utilization, TAF-PRMA independently controls the random access parameters such as the lengths of the access regions dedicated to respective service traffic and the corresponding permission probabilities, on a frame-by-frame basis. In addition, we have adopted a terminal-assisted random access mechanism where the voice terminal readjusts a global permission probability from the central controller in order to handle the 'fair access' issue resulting from distributed queuing problems inherent in the access network. Our extensive simulation results indicate that TAF-PRMA achieves significant improvements in terms of voice capacity, delay, and fairness over most of the existing medium access control (MAC) schemes for integrated services.

• International Journal of Contents
• /
• v.1 no.2
• /
• pp.13-17
• /
• 2005

Base Station Controller which belongs to IMT-2000(International Mobile Telecommunication - 2000) network has several types of structure for efficient control protocol. This difference of structure occurs two different protocols for call handling. Recently the need of IMT-2000 is highly increasing, so it is important to analyze the performance of processors and IPC(Inter-Processor Communication) module with structure of BSC and protocol difference. This paper presents the performance comparison of different types of BSC in view of processor utilization, waiting time, queue length and QoS(Quality of Service) through the simulation model.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.719-725
• /
• 2017

To reduce management costs and improve performance, the European Telecommunication Standards Institute (ETSI) introduced the concept of network function virtualization (NFV), which can implement network functions (NFs) on cloud/datacenters. Within the NFV architecture, NFs can share physical resources by hosting NFs on physical nodes (commodity servers). For network service providers who support NFV architectures, an efficient resource allocation method finds utility in being able to reduce operating expenses (OPEX) and capital expenses (CAPEX). Thus, in this paper, we analyzed the network service chain embedding problem via an optimization formulation and found a close-optimal solution based on the Markov approximation framework. Our simulation results show that our approach could increases on average CPU utilization by up to 73% and link utilization up to 53%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2605-2619
• /
• 1996

In this paper, we evaluated performance of mobile exchange control part. Queueing network model is used for modeling of mobile exchange control part. We developed a call control processing and location registration scenartio which has a message exchange function between processors in mobile exchange control part. A network symbol are used the simulation models that are composed of the initialization module, message generation module, message routing module, message processing module, message generation module, HIPC network processing module, output analysis module. as a result of computer simulation, we obtain the processor utilization, the mean queue length, the mean waiting time of control part based on call processing and location registration capacity. The call processing and location registration capacity is referred by thenumber of call attempts in the mobile exchange and must be satisfied with the quality of service(delay time).

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.141-149
• /
• 2012

This paper proposes a resource management and allocation algorithm to guarantee QoS continuity of realtime multimedia services and to maximize the resource utilization in heterogeneous wireless networks simultaneously. This scheme reserves the appropriate resources to be used by real-time multimedia services and allocates those resources left unused due to decreased transmission rate of realtime services to non-realtime services. Those resources can be preempted by the need of realtime services later. Performances are analyzed by simulation.