• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.57-60
• /
• 2004

Next generation wireless network is evolving toward IP-based network that can various provide multimedia services. A challenge in wireless mobile Internet is support of quality of service over wireless access networks. DiffServ architecture is proposed for evolving wireless mobile Internet. In this paper we propose an algorithm for optimal buffer partitioning which requires the minimal channel capacity to satisfy the QoS requirements of input traffic. We used a partitioned buffer with size B to serve a layered traffic at each DiffServ router. We consider a traffic model with a single source generates traffic having J $(J\geq2)$ quality of service (QoS) classes. QoS in this case is described by loss probability $\varepsilon_j$. for QoS class j. Traffic is admitted or rejected based on the buffer occupancy and its service class. Traffic is generated by heterogeneous Markov-modulated fluid source (MMFS).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.17-24
• /
• 2008

The effect of the variable packet size on the LRD characteristic of the MMPP traffic model is investigated. When we generate packet traffic for the performance evaluation of IP packet network, MMPP model can be used to generate packet interarrival time. And a random length of packet size from a certain distribution can be assigned to each packet. However, there is a possibility that the variable packet size might change the LRD characteristic of the original MMPP model. In this study, we investigate this possibility. For this purpose the 'refined traffic' is defined, where packet arrival time is generated according to the MMPP model and a random packet length from a specific distribution is assigned to each generated packet. Hurst parameter of the refined traffic is estimated and compared with the original Hurst parameter, which is the input parameter of the MMPP model. We also investigate the effect of the packet size distribution on the queueing performance of the MMPP traffic model and the relationship between the Hurst parameter and queueing performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.144-156
• /
• 2003

Internet/Intranet has been continuously enhanced by new emerging IP technologies such as differentiate service(DiffServ), IPSec(IP Security) and MPLS(Multi-protocol Label Switching) traffic engineering. According to the increased demands of various real-time multimedia services, ISP(Internet Service Provider) should provide enhanced end-to-end QoS(quality of service) and security features. Therefore, Internet and Intranet need the management functionality of sophisticated traffic engineering functions. In this paper, we design and implement the performance management functionality for the guaranteed end-to-end QoS provisioning on MPLS-based VPLS(Virtual Private LAN Service). We propose VPLS OAM(Operation, Administration and Maintenance) for efficient performance management. We focus on a scheme of QoS management and measurement of QoS parameters(such as delay, jitter, loss, etc.) using VPLS OAM functions. The proposed performance management system also supports performance tuning to enhance the provided QoS by re-adjusting the bandwidth of LSPs for VPLS. We present the experimental results of performance monitoring and analysis using a network simulator.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.345-350
• /
• 2001

IP 네트워크 상에 TCP 데이터 트래픽의 제공은 처리율과 공정성을 향상시키기 위해 특별한 기법이 필요하다. 여기에는 DT와 RED와 같은 많은 기법들이 제안되었다. RED 알고리즘은 폭주를 회피하고 적은 지연과 높은 처리율을 유지하기 위한 목적으로 제안되었다. 현재의 TCP/IP 환경에서 TCP 근원지는 Slow-Start 단계에 들어감으로써 드롭된 패킷에 반응하지만, 네트워크 이용률은 급속히 떨어진다. 폭주를 탐지하고, 이를 무작위로 선택된 연결에 통보하므로써 RED는 글로벌 동기화 및 공정성 문제를 유발한다. 본 논문에서는 성능을 향상시키기 위해 공정성을 유지하고, 글로벌 동기화 문제를 해결할 수 있는 능동적인 큐 관리 알고리즘을 제안한다. 제안된 알고리즘은 버퍼크기와 임계치 변화에 따른 goodput, 처리율, 공정성의 평가인자를 이용하여 기존의 기법인 DT, RED와 비교 분석을 수행하고, 제안된 기법의 타당성을 보인다.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.213-216
• /
• 2000

In this paper, we propose a new scheme which improves the IP address lookup time. The new scheme is composed of two core technologies, named the prefix alignment and the prefix distance ordering. Now, as the Internet is being used commonly by improving the data transmission capacity, the need for enlarging the bandwidth of the Internet is on the rise. IP address lookup performance problem is an important obstacle in the router executing high speed packet forwarding. This results from the fact that the prefixes routing table is composed of and the traffic being processed in unit time are largely on the increase. The proposed lookup scheme is divided into two parts in technology, the one is the algorithm forming a routing database(routing table), the other is the lookup procedure in the actual packet processing.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.75-81
• /
• 2003

In spite of widely deploying information broadcasting services based on Internet, there are some limitations to use them due to the bound of Internet protocol. In this paper, a new Internet broadcasting technology for access network and Location Based Services are proposed by employing IP address translation function in base station. There are some advantages such as, no need to allocate IP address to receiver no need to know web site address, and reduction of traffic for server and network.

• IE interfaces
• /
• v.14 no.3
• /
• pp.263-271
• /
• 2001

MPLS LER is located at the boundary of MPLS domain as an ingress or an egress router and plays a role in connecting with the existing Internet. Among the components of the MPLS LER, forwarding engine(FE) is a key device which assigns a label to an IP packet by analyzing the destination address of its header in order to enter the MPLS domain, or restructures the cells from MPLS domain into IP packet by reversely processing. In this paper, we investigate the design of FE by analyzing the traffic performance of its components and estimate the IP packet processing capacity of a FE using queueing model and simulation. It is found that the maximum IP packet processing capacity of the Forwarding Engine is about 150,000 packets/sec.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.118-120
• /
• 2001

제 3세대 이동통신 시스템인 UMTS는 인터페이스를 통해 전달되는 IP 패킷을 인터넷 망에 전송하기 위해 GPRS 시스템을 정의하고 있다. GPRS 시스템 중 게이트웨이 기능을 수행하는 GGSN은 이동망과 인터넷 망을 연결시켜주는 역할을 한다. Mobile IP 망에 가입된 가입자 또는 ISP 망에 가입될 가입자 간에 인터넷 서비스를 지속적으로 제공하기 위해 이동통신 망과 인터넷 당에 단일화된 하나의 라우팅 메커니즘이 필요하다. 따라서 본 논문에서는 이들 망 간의 패킷을 효율적으로 라우팅할 수 있는 IP-in-IP 방법을 제안한다. 그리고 제안한 방법에 따라 패킷 전송을 위한 기능, 처리 절차 및 메시지 구조를 설계하고 구현한다. 마지막으로 GGSN과 FA 시스템 간의 패킷 전송률, 그리고 GGSN과 FA/ISP 시스템을 동시에 연결한 상태에서 패킷 전송률을 살펴본다.

• Journal of Welding and Joining
• /
• v.18 no.3
• /
• pp.68-75
• /
• 2000

The incomplete penetration(IP) discontinuity in butt joint weld, which is detected during safety analysis of the steel bridge by nondestructive evaluation(NDE) method, is classified as unacceptable defect according to the NDE codes and standards. In fact, there are a little allowance in butt joint weld in the view point of design criterion, and also detected IP discontinuity should be classified and evaluated for the fatigue strength and residual life estimation. In this study, we performed fatigue test to evaluate the fatigue strength of high strength steel(SWS490A) containing IP discontinuities in various size, the results compared and classified according to the bridge construction standard specification which published by korea administration of construction and traffic. Experimental results could be used to evaluate and estimate the IP discontinuities considering different stress range in butt joint bridge weld during periodic safety inspection.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.438-438
• /
• 2000

본 논문에서는 네트웍의 traffic이 원활하지 못해 프레임에 대한 데이터 전부를 전송 받지 못하더라도 데이터가 들어오는 순서에 따라 영상을 복원한 수 있는 스트림에 대하여 연구를 하였다. 우선 CCD 카메라로부터 초당 24프레임의 영상을 획득한다. 그리고 획득한 영상을 2차원 웨이블릿 변환하여 얻은 중요한 계수를 다시 웨이블릿 변환을 한다. 위와 같은 방식으로 웨이블릿 변환을 네 번 반복하여 중요한 계수를 가지고 있는 대역에서 중요하지 않은 대역순으로 부호화하여 스트림을 구성한다. 그리고 영상을 서비스 받기를 친하는 수신자에게 UDP/IP를 이용하여 전송한다. 네트웍이 원활하지 않아 스트림 전부를 받지 못하더라도 먼저 전송받은 중요한 계수들로 복원하기 때문에 영상을 끊기지 않고 점진적으로 복원할 수 있었다. 이와 같은 땅법을 인터넷 생방송이나 VOD 서비스, 화상 채팅 등에 이용하면 훨씬 나은 영상을 서비스를 할 수 있을 것이다.