• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1907-1914
• /
• 1998

This paper proposes the adaptive connection admission cotrol using the variale MRR(measurement reflection ratio) and the distribution of the number of cells arriving during the fixed interval. This distribution is estimated from the measured number of cells arriving at the output buffer during the fixed interval and traffic parameters specified by user. MRR is varied by the difference of estimated distribution and measurement distribution. As MRR is adaptively varied by estimated distribution error of accepted connections, it quickly reduces estimation error. Also, the scheduling scheme is proposed for multiplexed traffic with various traffic characteristics. For each traffic class, this scheme estimates adaptively equivalent bandwidth and schedules according to equivalent bandwidth ratio of each traffic class, so it improves cell loss rate and link utilization.

• Convergence Security Journal
• /
• v.21 no.3
• /
• pp.31-38
• /
• 2021

Tor, known as Onion Router, guarantees strong anonymity. For this reason, Tor is actively used not only for criminal activities but also for hacking attempts such as rapid port scan and the ex-filtration of stolen credentials. Therefore, fast and accurate detection of Tor traffic is critical to prevent the crime attempts in advance and secure the organization's information system. This paper proposes a novel classification model that can detect Tor traffic and classify the traffic types based on CNN(Convolutional Neural Network). We use UNB Tor 2016 Dataset to evaluate the performance of our model. The experimental results show that the accuracy is 99.98% and 97.27% in binary classification and multiclass classification respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.360-362
• /
• 2000

동적 메트릭을 사용하는 단일 경로 라우팅 방식이 폭주에 대처하는 방법은 폭주 영역을 피해갈 수 있도록 경로를 바꾸어주는 것이다. 그러나, 이러한 라우트 변경은 라우팅 진동을 야기할 수 있고, 폭주에 대응하여 실제적으로 네트워크 상에 존재하는 다중의 경로들을 모두 동시에 이용할 수 없다는 한계점이 있다. 이에 본 논문에서는 라우팅 오버헤드 측면에서 매우 효율적이면서, 라우팅 성능을 높일 수 있는 동적 로드 밸런싱을 수행하는 다중 경로 라우팅 방식인 MP-DLB를 제안하였다. MP-DLB 방식은 hot 목적지에 대해서만 다중 경로를 설정하고, 이들 다중 경로에 대해서만 동적 로드 밸런싱을 수행한다. 제안하는 MP-DLB 방식의 성능을 검토하기 위하여 시뮬레이션을 실험한 결과, MP-DLB는 hot 목적지를 향하여 임의의 라우터에 집중되고 있는 여러 소스로부터의 트래픽을 다중 경로를 이용해 분산 전송함으로써 효과적으로 폭주를 경감시키고 라우팅 성능을 높임을 볼 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.523-525
• /
• 2001

MPLS(Multi-Protocol Label Switching)망에서 LSP(Label Switched Path)의 수와 레이블 수를 줄이는 것은 망 자원 관리 측면에서 매우 중요하다. 다중점대점(Multipoint-to-Point) LSP[1]는 이러한 요구사항으로 제안되었다. 하나의 다중점대점 LSP는 다수의 망 입구 노드로부터 하나의 망 출구 노드까지의 경로를 나타낸다. 다중 점대점 LSP는 미리 정의된 경로이다. 망 형태 정보가 빈번히 변하는 실제 망을 고려할 대 다중점대점 LSP는 경로가 신속히 재결정될 필요가 있다. 본 논문에서는 망의 트래픽 부하 균형을 위해 Monte-Carlo 시뮬레이션을 이용한 빠른 LSP 결정 방법을 제시한다. 또한 경로 결정시 Greedy 알고리즘을 사용하므로 최적의 다중점대점 LSP 결정에 접근하는 경로를 결정한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.307-312
• /
• 2000

Asynchronous transfer mode(ATM) is flexible to support the various multimedia communication services such as data, voice, and image by applying asynchronous time-sharing and statistical multiplexing techniques to the existing data communication. ATM service is categorized to CBR, VBR, UBR, and ABR according to characteristics of the traffic and a required service qualities. Among them, ABR service guarantees a minimal bandwidth and can transmit cells at a maximum transmission rate within the available bandwidth. To minimize the cell losses in transmission and switching, a feedback information in ATM network is used to control the traffic. In this paper, predictive control algorithms are proposed for the feedback information. When the feedback information takes a long propagation delay to the backward nodes, ATM switch can experience a congestion situation from the queue length increases, and a high queue length fluctuations in time. The control algorithms proposed in this paper provides predictive control model using slop changes of the queue length function and previous data of the queue lengths. Simulation shows the effectiveness result of the proposed control algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.3
• /
• pp.243-251
• /
• 1990

In this paper, the performances of bandwidth allocation strategies for wideband ISDN have been studied through the computer simulation. In general, the performance of multichannel bandwidth allocation method is superior to that of single channel bandwidth allocation method with respect to the throughtput, delay and blocking probability. Also, when the FIFO service scheme is used, it is shown that the throughput, delay characteristics and blocking probability for each traffic are almost similar. On the other hand, the priority service scheme being used, the performances of traffic with high priority are much better than that of traffic with low priority in the view of throughput, delay and blocking probability. Finally, for the FIFO and priority service disciplines, it can be seen that the multichannel bandwidth allocation method is more suitable than the single channel bandwidth allocation strategy in the case of serving various traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.507-513
• /
• 2005

As the rapid increasement of the number of internet users has occured recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as Von(Voice over Internet Protocol), and for real-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analized with simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2605-2614
• /
• 1997

Recently, we are concerned with effective service according as the demand increase for high speed data service. We can use high speed transfer and multiple traffic service on the ATM networks, so we concentrate on preventive-control method rather than reactive-control one. But it is possible to have low QoS and traffic congestion due to unpredictable traffic and burst traffic. Specially, ATM Forum has discussed to standardization of traffic management of ABR(Available Bit Rate) service. Because ABR traffic controls the flow of traffic using the feedback information and the current status information of cell, it allocates bandwidth systematically and dynamically to the user. In this paper, we propose a new Rate-based flow control scheme which adapted double threshold buffer idea. The double threshold buffer controls the traffic control by establishing two threshold in buffer.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.272-283
• /
• 2010

Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Based on the characteristic of WMNs as a highly connected wireless infrastructure, many efforts from research organizations are made in order to improve the performance of the flow throughput in WMNs. Therefore, it is very critical issue to establish efficient routing paths for multiple concurrent ongoing flows. In this paper, we propose a general modeling methodology to analyze the end-to-end throughput of multiple concurrent flows by analytical calculation taking into account the carrier sensing behaviors, interference and the IEEE 802.11 Distributed Coordination Function mechanism. After the comparison of the average service time for each successful transmission at each node, we analyze the bottlenecks of flows, and hence obtain the maximum end-to-end throughput of them. By using our proposed model, it is possible to predicate the throughput of several candidate routing paths for multiple concurrent ongoing data flows, so we can select the most efficient route that can achieve the highest throughput. We carry out simulations with various traffic patterns of multiple flows in WMNs to validate our modeling and our efficient route selection mechanism.