• Journal of Internet Computing and Services
• /
• v.4 no.2
• /
• pp.1-9
• /
• 2003

Path restoration, which is needed to increase network survivability in MPLS networks, is a technology of supplying reliable service by delivering the traffics through restoring the paths when links or nodes of a working path are failed. In this paper, we propose a path restoration method using duplication of working paths for link failure as a method of restoring paths for the high priority traffics. The existing path restoration method transmits the traffics to the path restoration uniformly in regardless of the priority while link obstacle. It has a problem to take a long time to restore the connection of the high priority traffics. On the other hand, the suggested restoration method establishes the duplication path for the working path, which transmits the high priority traffics and transmit the traffics through the duplication path. It has a strong point to restore the connection quickly. Also, through simulation we analyze the performance of the restoration system using the duplication path and prove that the proposed restoration method is superior in performance to the existing restoration methods regarding to the high priority traffics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.750-760
• /
• 1994

In this paper we proposed a multiplexing scheme of real time and non-real traffics in which a congestion control is embedded. Real time traffics are assumed to be nonqueuable and have preemptive priority over non-real time traffics in seizing the common output link, whereas the non-real time traffics wait in the common buffer if the output link is not available for transmission. Real time traffics are encoded according to the bandwidth reduction strategy, paticularly when congestion occurs among non-real time traffics. This scheme provides us an efficient way for utilizing the costly bandwidth resources, by accommodation as many real time traffics as possible with gauranteeing its mimimum bandwidth requirements, and also resloving the congestion encountered among non-real time traffics. We describe the system as a Markov queueing system, provide the analysis by exploiting the matrix geometric method, and present the performance for various performance measures of interest. Some numerical results are also provided.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.603-627
• /
• 1998

The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.40-47
• /
• 1996

A method for computing effectiv ebandwidth of aggregated varable bit rate (VBR) moving picture experts group (MPEG) video traffic is proposed. To compute statistical characteristics of aggregated MPEG traffic, first we split input MPEG traffic into I, B, and P frame traffics and aggregate respective I, B, and P frame traffics according to the frame type. Second statisticsal characteristics of the aggregated MPEG traffic are obtained using those of aggregated I, B, and P frame traffics. The effective bandwidth of the aggregated I frame traffic is computed by using the gaussian bound. Using the modified equivalent capacity, we obtain the effective bandwidths of aggregated B and P frame traffics and then compute the effective bandwidth of the combined B and P frame traffic. Finally the effective bandwidth of the aggregated MPEG traffic is computed by adding the gaussian bound of the aggregated I frame traffic and modifed equivalent capacity of combined B and P frame traffic. Computer simulation shows that the proposed method estimates effective bandwidth of the aggregated MPEG traffic well.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.10
• /
• pp.790-798
• /
• 1991

The congestion control methods of an integrated heterogeneous traffic multiplexer are studied. The real-time traffics have preemptive priority over nonreal-time traffics in capturing the common output link. Also real-time traffics are transmitted with bandwidth reduction when the nonreal-time traffics are over the buffer threshold. The proposed model formulated the system as a continous time Markov process and is analysed using matrix equation. Time delay and average number of used channel are applied for performance parameters. In this study, a new control method with the sizable buffer threshold is introduced and the optimal congestion control can be obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1190-1200
• /
• 1993

In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.317-326
• /
• 2010

Nowadays, transmission bandwidth for network traffic is increasing and the type is varied such as peer-to-peer (PZP), real-time video, and so on, because distributed computing environment is spread and various network-based applications are developed. However, as PZP traffic occupies much volume among Internet backbone traffics, transmission bandwidth and quality of service(QoS) of other network applications such as web, ftp, and real-time video cannot be guaranteed. In previous research, the port-based technique which checks well-known port number and the Deep Packet Inspection(DPI) technique which checks the payload of packets were suggested for solving the problem of the P2P traffics, however there were difficulties to apply those methods to detection of P2P traffics because P2P applications are not used well-known port number and payload of packets may be encrypted. A proposed algorithm for identifying P2P heavy traffics based on flow transport parameters and behavioral characteristics can solve the problem of the port-based technique and the DPI technique. The focus of this paper is to identify P2P heavy traffic flows rather than all P2P traffics. P2P traffics are consist of two steps i)searching the opposite peer which have some contents ii) downloading the contents from one or more peers. We define P2P flow patterns on these P2P applications' features and then implement the system to classify P2P heavy traffics.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.139-146
• /
• 2008

Despite of information security installation, leakage of personal information in web services has not decreased. This is because traffics to web applications are still vulnerable by permitting external sources to access services in port HTTF 80 and HTTPS 443, even with firewall systems in place. This thesis analyzes various attack patterns resulted from web service environment and vulnerable traffic and categorizes the traffics into normal and abnormal traffics. Also this proposes ways to analyze web application attack patterns from those abnormal traffics based on weak points warned in OWASF(Open Web Application Security Project), design a system capable of detect and isolate attacks in real time, and increase efficiency of preventing attacks.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.52-59
• /
• 1996

The boroadband ISDN will transprot the traffics for a wide range of applications with different quality-of-service (QOS) requirements and the priorit control mechanism is an effective method to support multiple classes of services. This paper proposes a new mechanism to satisfy simultaneously the different levels of cell loss performance for the two classes of heterogeneous nonreal-time ATM traffics as well as the delay and loss requirements of real-time traffics. Its performance is analyzed using the stochastic integral approach with the cell arrivals of input streams modeled as markov modulated poisson processes.