• 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.30 no.6
• /
• pp.787-798
• /
• 2003

The flow label field in IPv6 has been proposed to provide the QoS. Since the existing flow label specification scheme like random-number format utilizes the label only as the identifier of flow, it is not appropriate for providing differentiated services according to the characteristics of various types of real-time traffic. This paper proposes a hybrid scheme that makes use of the flow label fields as components of flow and QoS parameters as well. To be specific, this paper investigates a scheme that both guarantees the end-to-end service quality and utilizes efficiently backbone resources by allowing users to specify QoS parameters using flow labels. Assuming an MLPS-TE network as the backbone, we compare the performance of our proposed scheme with that of random-number scheme through simulation. The simulation result shows that our scheme is more efficient than the existing one in terms of the transmission rate as well as the resource utilization of the backbone.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 1998.11a
• /
• pp.223-225
• /
• 1998

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.666-668
• /
• 1998

In this paper we illustrate the design of a node label data flow machine based on self-timed paradigm. Data flow machines differ from most other parallel architectures, they are based on the concept of the data-driven computation model instead of the program store computation model. Since the data-driven computation model provides the excution of instructions asynchronously, it is natural to implement a data flow machine using self timed circuits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1169-1176
• /
• 2000

In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4092-4107
• /
• 2015

We propose a background subtraction method for moving cameras based on trajectory classification, image segmentation and label inference. In the trajectory classification process, PCA-based outlier detection strategy is used to remove the outliers in the foreground trajectories. Combining optical flow trajectory with watershed algorithm, we propose a trajectory-controlled watershed segmentation algorithm which effectively improves the edge-preserving performance and prevents the over-smooth problem. Finally, label inference based on Markov Random field is conducted for labeling the unlabeled pixels. Experimental results on the motionseg database demonstrate the promising performance of the proposed approach compared with other competing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.819-824
• /
• 2015

SDN (Software Defined Network) technology, hardware and network control functions should be separated independently of existing switches or routers and data transfer functions and are also refers to a separate network architecture that can develop and run. When planning a network and designed to reflect the network control function by applying the SDN may reflect the resources efficiently. In this study, one people suggest Applications SDN, which offer an absolutely necessary part of a coded program that combines the benefits of the existing IOS (Combined Benefits) applying the model to complete the Controller part through the MPLS IOS. The OpenFlow Controller is a command to the router LER(Label Edge Router), and transmits the packet in accordance with the command to the destination according to the EXP bit. To configure TCP / IP to the IOS through the optimized coding. Using the OpenFlow protocol controller transmits an encapsulation header as defined in the MPLS packet.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.235-245
• /
• 2005

In this paper, a simplified QoS model of MPLS-based backbone network. Conventional scheme proposed by IETF(IETF schem) is to embed a DiffServ model in MPLS network. However, this approach results in overall upgrade of MPLS system and so it is difficult to deploy this approach. Our proposed model, however, uses a Vidual Link which is a set of Label Switched Path(LSP) connected from an Ingress Label Edge Router(LER) to an Egress LER. In this model, Per-Hop-Behavior(PHB) is implemented only at each LSP in ingress LER and Core Label Switch Routers(LSRs) just guarantee each LSP's bandwidth, not service. This bandwidth guarantee service is fully provided by legacy MPLS model. Also we propose flow allocation mechanism and the flow distribution among LSPs of the virtual link by the flow according to the network status. To evaluate the simplified approach, the characteristics of the approach are compared logically with these of IETF's one through simulations.