• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5A
• /
• pp.889-901
• /
• 2001

본 논문에서 Multiprotocol Label Switching 시스템을 위한 Label Distribution Protocol의 개발과 분석에 관해서 기술한다. 먼저 Gigabit Switched Router를 만들기 위해서, 상용화시 Carrier Class 제품에 적용하기 위한 LDP의 구현시 고려해야 될 사항에 대해 살피고, 상세 설계를 제안한다. IETF 표준에 의거한 LDP의 구현을 위한 상세 설계는 프로토콜 상태기계의 유도 트리와 프로세스 대수를 사용한 형식적 명세를 사용하여 제시한다. 본 논문에서는 제시된 유도트리와 프로세스 대수를 사용한 프로토콜 동작의 분석을 통해, 구현된 LDP의 상호 연동성과 완전성, 생존성, 도달성, 안전성을 검증한다. 또한 이를 사용하여 구현된 LDP가 기존 상용 제품들과의 연동성과 그 동작의 신뢰성을 확보할 것을 기대한다. 결과적으로 구현된 LDP의 프로토콜 동작들의 검증을 제공한다.

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

In this paper, we present the flow aggregation method and the FLTC(flow lasting time control) algorithm to reduce the number of flows and solve the scalability problem in high speed IP switching networks. The flow aggregation based on the destination address could reduce the total number of flows, improve the label efficiency, and increase the total amount of the switched packets. The FLTC algorithm also eliminates the waste of label by deleting the flow binding efficiently. With the traces of real Internet traffics, we evaluate the performance of these schemes by simulation. The label efficiency, the average number of label used, and the percentage of packets switched and the number of packets switched are used as performance measures for this simulation.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.24-30
• /
• 2002

Label switching technology is currently emerging as a solution for the rapidly growing of Internet traffic demand. Multiprotocol label switching(MPLS) is one of the standards made by the Internet Engineering Task Force(IETE) intended to enhance speed, scalability, and inter-opearability between label switching technologies. In MPLS, utilization of label space is a very important factor of network performance because labels are basic unit in packet switching. We propose a algorithm to effectively use label space by a multiple disconnect timer at the label switching router. Our algorithm is based on multiple utilization of the connection release timer over the MPLS network with multiple domains. In our algorithm, a relatively linger timeout interval is assigned to the traffic with higher class by the aid of the packet classifier. This reduces delay for making a new connection and also reduces the amount of packets which will be routed to the layer 3. Simulation results shows that reduction of required label number in MPLS network and this indicate our algorithm offers better performance than the existing ones in term of utilization of label space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2249-2261
• /
• 1999

In this paper, we describe the design and implementation of the Label Distribution Protocol (LDP) for Multiprotocol Label Switching System. We review the implementation issues of LDP that is required to make a gigabit switched router, and propose a detail design of it. We present the data structures and procedures for the LDP as a result, which are based on IETF standard. We present design issues for applying this to carrier class products. The implemented protocol could afford 40,000 entries of the IP routing table that is required for deploying this system to commercialized data network. Furthermore this system implemented using the standard API of Unix, as a result, it has portability. By implementing LDP based on the international standard and these implementation issues, we expect that the implemented LDP will be interoperable with other commercialized products. We prove the validity of the design of the LDP through prototyping, and also verify the prototype with the specification using the process algebra and the performance analysis.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.251-261
• /
• 2001

The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged. EspeciaJJy in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching packets, and cache table management is to maintain the cache table which contains information for flow classification and label switching. However, the cache table management affects the performance of label switching network considerably as well as flowclassification because the bigger cache table makes more packet switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user. So in this paper, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router. we introduce FIFO(First In First Out). LFC(Least Flow Count), LRU(Least Recently Used! scheme and propose priority LRU, weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC, LRU-LRU scheme and propose LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.68-73
• /
• 2001

MPLS(Multi protocol Label Switching) is standard skill for added to speed and control the Network Traffic. MPLS concerned the routing protocol to relative Pack line, Each Pack composed label and node, saved the time to seek the address of node. MPLS worked IP, ATM and Network protocol of flame rely. MPLS is Network OSI suport model, 2Layer send to most of Packinsted of 3Layer Switching. MPLS is added speed Traffic of QoS and effective controled the Network.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.109-112
• /
• 1999

In this paper, we propose more effective method of label allocation on Multi-Protocol Label Switching (MPLS) which is IP over ATM integrated model. We research the problems, one is using downstream label allocation method case, the other is using both downstream and upstream label allocation method. Easily we can solve this problem through the downstream-on-demand label allocation method with RSVP(Resource ReSerVation Protocol). In experiment we can find 1.5~28% error which will be fixed by using downstream-on-demand label allocation method.

• The Journal of the Korea Contents Association
• /
• v.11 no.9
• /
• pp.54-62
• /
• 2011

This paper proposes both global and local mobility management (MM) scheme improved from Multi Protocol Label Switching (MPLS)-based Mobility Management scheme (MPLS-MOB) for seamless service in Next Generation Network (NGN). The proposed scheme adds local MM on the existing MPLS-MOB which supports global MM by processing handover signaling by 2.5 layer switching via Label Switch Path (LSP) of MPLS. We numerically analyze and verify that the proposed scheme has lower handover latency time than the existing ones, such as micro-MM methods using MPLS as well as MIP and an interworking scenario between PMIP and MIP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.437-445
• /
• 2000

More advanced and demanding applications, like videoconferencing, video on demand. distributed computing etc., have been devised thanks to the availability of enhanced network feature. Network technologies need to be enhanced to support these applications and to cope with the increasing number of users. Increasing the availability of network resources is just not enough to achieve this goal; scalable network architecture. increased packet forwarding capabilities, a wider range of services are all additional requirements. MOLS (multiprotocol label Switching) is one of the new networking techniques under standardization in the scientific community. In this paper, we analyze the performance of label switching in ATM networks. Simulation tests were performed. In this simulation, we set a simple network configuration and used internet traffic traces from NLANR as input traffic sources. The simulation results and analysis will be helpful in utilizing the functions of ATM switching and IP routing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.9-16
• /
• 2005

The growth of the Internet over the last several years has placed a tremendous strain on the high bandwidth Hence, the amount of internet traffic has risen sharply and it has demanded to use the limited resource. MPLS (Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. It is important to reduce the number of labels and LSP(Label Switched Path)s for network resource management. In this thesis, we considered an MPLS multicast mechanism in the current Internet. The scalability problem due to lack of labels and multicast property is one of the serious problems in MPLS multicast mechanism, we proposed a Label Aggregation algorithm that the multicast packets on same link in MPLS allocates the same label for the scalability problem. In order to support the proposed algorithm we defined a new LDP(Label Distribution Protocol) multicast field and multicast packet is copied and transmitted for multicast group links of next node in LSR(label Switch Router).