• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9B
• /
• pp.778-790
• /
• 2004

In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data bounda η with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parame ‘ ers as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

• 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 Information Science Society Conference
• /
• 2004.10c
• /
• pp.547-549
• /
• 2004

본 논문에서는 IP/MPLS 망에서 QoS 보장형 차별화 서비스 제공을 위한 Virtual Networking 구조를 제안한다. 제안한 구조에서는 멀티미디어 단말장치와 PE(Provider Edge) 사이에서 RSVP-TE를 이용한 signalling을 통해 연결설정을 요청하고 PE에서 CAC(Call Admission Control)가 이루어질 수 있도록 한다. 또한 provider network에서 일반 가입자에게 QoS 보장형 차별화 서비스를 제공해줄 수 있도록 Multiple Virtual Network을 구성하며, class-type별로 차별화된 virtual network을 구성하기 위해서 L-LSP를 PE간에 full-mesh 형태로 설정한다 본 논문에서 제안한 Virtual Networking을 통하며 망 사업자는 보다 효율적으로 망을 관리하며, 통신망 자원의 이용율을 극대화시키고 사용자들에게 QoS 보장형 차별화 서비스를 제공해주는 것이 가능하다.

• 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 Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.29-40
• /
• 1997

Two asymptotic analyses of the queue length distribution at a statistical multiplexor supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rates as a multi-dimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, w state with a system of linear equations derived from the exact expressions of the dominant eigenvalue of the matrix governing the queue length distribution. Assuming that there are a large number of sources, we obtain asymptotic approximations to the dominant eigenvalue. Based on the analyses, we define a traffic descriptor to include the mean and the variance of the cell generation rate and a burstiness measure. A simple expression for the quality of service (QoS) in cell loss rate is derived in terms of the traffic descriptor parameters and the multiplexor parameters (output link capacity and buffer size). The result is then used to quantify the factors determining the required capacity of a call taking the statistical multiplexing gain into consideration. As an application of the analyses, we can use the required capacity calculation for simple yet effective connection admission control(CAC) algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1113-1116
• /
• 2000

기존의 연구에서는 셀룰러 망에서 호 수락 제어 시에 다음 두 가지 요소를 고려하지 않는다. 첫 번째 요소는 각각의 셀, 특히 micro/pio 셀에서 서비스 제공이다. micro/pico 셀과 같이 심한 트래픽 변동이 있는 셀에서는 호 단절률이 수렴할 수 없기 때문에 이동 QoS와 서비스 제공이 불가능하다. 두 번째 요소는 망에서 호를 수용할 수 있는 능력과 관련 있는 GOS 이다. 일반적으로 여러 비율의 서비스는 서비스의 집합으로 특정지을 수 있고, 각각의 것들은 다른 양의 대여폭을 요구한다. 이질적인 멀티미디어 서비스 클래스를 가진 망에서는 소수의 광대역호가 망 자원의 대부분을 점유해서, 신규호에 대한 봉쇄로 망 성능을 떨어뜨릴 수 있다 그래서, GoS는 광대역호 제어에 의해서 향상될 수 있다. 본 논문에서는 이동 트래픽 조건에서 서비스 제공이 가능한 셀들의 최소 집합이면서 논리적인 단위인 지역이라고 불리는 새로운 개념을 소개한다. 그리고 서비스 제공 단위가 셀보다는 지역단위로 한 경우에 성능이 더 좋고 GoS 를 향상시킬 수 있는 방법인 지역기반 CAC 를 제한한다. 마지막으로 시뮬레이션에서는 QoS와 GoS 관점에서 RCAC가 현재까지 제안된 다른 방법보다 더 좋은 성능을 제공한다는 것을 보여준다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.