• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.11-18
• /
• 2004

In this paper, we propose the alternative LSP allocation for MPLS networks required more confidence. In the first place, we must classify the user traffics by the QoS parameter. We assigned altermative LSPs on realtime traffics and then allocated alternative LSPs of non-realtime traffics. The proposed algorithm can provide more confidential alternative LSP by priority method for relatively high cost realtime traffic error. And the proposed algorithm can improve the shortage of network resources what is occured by using a few links when altermative LSPs are setup. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the program tool and comparison with conventional methods. Also, that improves 9% more than existing method in the recovery ratio-one is 89%, the other is 98%, respectively.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.429-438
• /
• 2004

This Paper Presents the control structure for incoming traffic from arbitrary node to Provide admission control in policy-based W network management structure using fuzzy logic control approach. The proposed control structure uses scheme for deciding network resource allocation depending on requirements predefined-policies and network states. The proposed scheme enhances policy adapting methods of existing binary methods, and can use resource of network more effectively to provide adaptive admission control, according to the unpredictable network states for predefined QoS policies. Simulation results show that the proposed controller improves the ratio of packet rejection up to 26%, because it Performs the soft adaption based on the network states instead of accept/reject action in conventional CAC(Connection Admission Controller).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.907-910
• /
• 2003

이동통신 기술이 발전함에 따라 이동통신 네트워크를 통한 서비스들이 다양해지고, 사용자들의 수는 점점 늘어가고 있다. 또한 사용자들은 일반적으로 이동통신 서비스에 대해 유선 망과 동등한 수준의 품질을 기대한다. 그러나, 이동통신망은 유무선 통합망으로 구성되어 있으며, 이들 복잡한 구성을 갖는 네트워크에 대한 서비스 품질 보장은 유선망에 비해 훨씬 어렵다. 이의 결과로, 이동통신 서비스 네트워크의 트래픽은 과거에 비해 폭발적으로 증가하였다. 따라서, 네트워크 사업자와 서비스 제공자들은 서비스의 성능 문제에 직면하고 있으며, 네트워크 사업자나 서비스 제공자들은 효과적인 서비스 품질관리 기술을 강력하게 요구하고 있다. QoS 감시는 QoS 제공과 보장을 위한 기본적인 기술로서, 실제 네트워크에서 QoS 감시를 위해서는 네트워크 및 서비스 성능 인자들과 QoS 인자들의 관계를 식별해야 한다. 본 논문에서는 서비스와 네트워크 성능인자 그리고, QoS 인자들간의 관계를 QoS metrics로 정의하며, 각 인자들의 관계는 계층적인 그래프로 나타낸다. QoS metrics의 정의와 이에 따른 계층적 그래프의 구성을 통해 세 가지 이점을 기대 할 수 있다. 첫째, 네트워크 사업자들은 QoS 저하의 주요 원인을 신속하게 식별 할 수 있다. 둘째, 네트워크 사업자들과 서비스 제공자들은 주관적인 QoS 를 수치 적인 성능 지표를 통해 측정이 가능하다. 마지막으로, QoS metrics 는 네트워크 사업자들과 서비스 제공자들이 QoS 감시 활동의 결과에 따라 그들의 네트워크를 재구성하는 데 도움을 주며 E2E QoS 제공에 효율성을 가져다 준다.현을 정형화하기 위해 Oolong 코드의 명령어들을 문법으로 작성하였으며, PGS를 통해 생성된 어휘 정보를 가지고 스캐너를 구성하였으며, 파싱테이블을 가지고 파서를 설계하였다. 파서의 출력으로 AST가 생성되면 번역기는 AST를 탐색하면서 의미적으로 동등한 MSIL 코드를 생성하도록 시스템을 컴파일러 기법을 이용하여 모듈별로 구성하였다.적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.477-482
• /
• 2007

최근 다양한 P2P 프로그램을 많이 사용함에 따라 네트워크에서 생겨나는 트래픽의 상당 부분이 P2P가 발생시키는 트래픽으로 이미 HTTP, FTP의 양을 훨씬 뛰어넘고 있다. 현재 인터넷 환경에서 방화벽을 통과하기 위해 포트번호를 변경하여 통신을 하는 새로운 P2P응용들의 행동들은 전통적인 well-known port 기반의 응용프로그램을 구분하는 단순한 분석 방법만으로 신뢰하기가 어렵다. 새로운 P2P 응용들과 같은 트래픽 모니터링의 정확도를 높이기 위해서는 TCP/IP 헤더만이 아니라 패킷이 담고 있는 페이로드 내용에 대한 조사 차원의 모니터링 방법이 필요하다. 본 논문에서는 TCP/IP 헤더 정보와 더불어 패킷의 페이로드 내용을 조사하여 P2P 트래픽을 탐지하는 모니터링 기법을 제안한다. 이어 탐지되는 P2P 트래픽에 대하여 Linux Netfilter Framework의 Queuing Discipline에서 제공하는 계층적인 우선순위 큐를 사용하여 일정한 양의 대역폭을 할당하는 정책을 적용함으로써 안정적이면서 효율적인 네트워크 운용 방안을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1285-1294
• /
• 1999

In this paper we consider the performance of TCP video traffic over ABR with Long-Range Dependent VBR traffic. As compressed coded video traffics are increasing rapidly over Internet, lots of studies are being done for transmitting those traffics efficiently using limited network resources. We consider here the transmitting video service over ABR service in ATM networks, especially satellite networks. CBR or VBR services are suggested in transmitting the video traffic in ATM Forum TM 4.0. But ABR service connection, which is considered as appropriate service for data traffic, can be established with a small amount of bandwidth, MCR (Minimum cell rate). Furthermore ABR service can control the source's transmitting rate using feedback mechanism. Using this feature ABR service can be used in some applications which can control their quality of services corresponding to network loads. Compressed video sources with MPEG-2 are used for Long-Range Dependent VBR traffic here. We model the compressed video source to resemble the MPEG-2 transport streams. These compressed video traffic streams are consisted of three different frames, I-frame, P-frame, and B-frame. So when a network are overloaded, we can control the quality of service using this traffic features. TCP Traffics over ABR need large buffers in ATM switch to satisfy their QoS with background VBR traffics, which have high deviations in bandwidth. Furthermore satellite ATM networks with large feedback delay need large buffers corresponding RTT delay. The performance comparisons among EFCI and ER switch (ERICA+) switches in the network circumstances described above were shown in this paper. We also considered the case with ON-OFF VBR traffics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.279-288
• /
• 2004

Rapidly emerging P2P(Peer to Peer) applications generate very bursty traffic, which gives a lot of burden to network, and the amount of such traffic is increasing rapidly. Thus it is becoming more important to understand the characteristics of such traffic and reflect it when we design and analyze the network. To do that we measured the traffic in a campus network and present flow statistics and traffic models of the measured traffic, and compare them with those of the web traffic. The results indicate that P2P traffic is much burstier than web traffic and as a result it negatively affects network performance. We modeled P2P traffic using self-similar traffic model to predict packet delay and loss occurred in network which are very important to evaluate network performance. We also predict queue length distribution and loss probability in SSQ(Single Sewer Queue). To assess accuracy of traffic model, we compare the SSQ statistics of traffic models with that of the traffic trace. The results show that self-similar traffic models we use can predict P2P traffic behavior in network precisely. It is expected that the traffic models we derived can be used when we design network capacity and predict network performance and QoS of the P2P applications.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.75-81
• /
• 2012

This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1087-1095
• /
• 2014

A recent major development in computer technology is the advent of the wearable computer system that is based on human-centric interface technology trends and ubiquitous computing environments. Wearable computer systems can use the wireless universal serial bus (WUSB) that refers to USB technology that is merged with WiMedia PHY/MAC technical specifications. In this paper, we focus on an integrated system of the wireless USB over the IEEE 802.15.6 wireless body area networks (WBAN) for wireless wearable computer systems supporting U-health services. And a communication structure that can differentiate QoS of U-health WBAN and WUSB traffic with different priorities is proposed for WUSB over IEEE 802.15.6 hierarchical protocol. In our proposal and performance evaluation, throughputs of U-health WBAN and WUSB traffic are analyzed under single and multiple QoS classes to evaluate the effectiveness of proposed QoS differentiating structure in WUSB over IEEE 802.15.6.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.398-398
• /
• 2004

• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.49-57
• /
• 2009

This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.