• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.35-42
• /
• 2012

Increase of data traffic and the advent of new real-time services require to change from the traditional TDM-based (Time Division Multiplexing) networks to the optical networks that soft and dynamic configuration. Voice and lease line services are main service area of the traditional TDM-based networks. This optical network became main infrastructure that offer many channel that can convey data, video, and voice. To provide high resilience against failures, Packet-optical networks must have an ability to maintain an acceptable level of service during network failures. Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Packet-optical networks with a Generalized Multi-Protocol Label Switching(GMPLS) control plane. The goal of this paper is to provide packet-optical network with a hierarchical multi-layer recovery in order to fast and coordinated restoration in packet-optical network/GMPLS, focusing on new implementation information. The proposed schemes do not need an extension of optical network signaling (routing) protocols for support.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.1
• /
• pp.76-83
• /
• 2011

The IEEE WAVE-based communication systems do not provide handover services since most of the application layer messages of a small amount containing text data that are related to safe driving. Multimedia data service such as web pages and CCTV video clips, however, require a seamless handover for continuation of a session via multiple RSUs. In this paper, we propose a new proactive handover protocol based on IEEE WAVE. According to the proposed handover protocol, the OBU notifies the old RSU of its departure from the coverage such that the old RSU forwards to the new RSU the data heading towards the OBU to be cached for the further delivery upon its entry into the new RSU's coverage. The simulation results are presented which shows the performance of the proposed protocol in terms of throughput, delivery ratio and handover delay.

• International Journal of Highway Engineering
• /
• v.18 no.6
• /
• pp.69-76
• /
• 2016

OBJECTIVES : The objective of this study is to propose a capacity analysis methodology for riverside bike-exclusive roads. METHODS : Three steps were performed to develop a methodology to estimate bikeway capacity. First, we reviewed previous studies on the vehicle-road capacity analysis and proposed their applicability to bikeways. Second, two assumptions were made based on the traffic flow characteristics of bikeways: (1) the capacitated state in bikeways occur within a bicycle platoon, and (2) a bicycle platoon consists of more than three bicycles running in close proximity. In addition, it is assumed that the mean time headway of a bicycle platoon represents the characteristics of the platoon. The normality of the mean-time headway of a bicycle platoon calculated using the central limit theorem leads to the development of a method that estimates the riverside bikeway capacity using data collected from two different riverside bike-exclusive roads (Han-river and Anyangcheon). We used a location-fixed video camera to record videos of running bicycles and wrote a special-purpose software program to code the time-headway data from the videos. RESULTS : Time headways from 189 bicycle platoons were analyzed. The estimated mean-time headway of the capacitated bicycle flow is 1.01 s, from which the capacity of the bikeway is found to be 3578 vehicles/h. CONCLUSIONS : The proposed method that estimates bikeway capacity could be applicable to the analysis of short-range congested area rather than planning the number of lanes. In other words, it determines the sections that are temporarily highly congested and proposes appropriate strategies to mitigate the congestion.

• Journal of Satellite, Information and Communications
• /
• v.12 no.3
• /
• pp.8-14
• /
• 2017

In 4G mobile communication, data services of mobile communication began to be provided in earnest. As a result, services such as the internet and multimedia including the video have become the main contents in the recent wireless traffic. Accordingly, research on 5G mobile communication with higher transmission rate has been actively carried out. 5G mobile communication is expected to be based on 4G for compatibility with existing terminals. Therefore, the simulation of this paper is based on 4G and we propose a new user scheduling scheme based on the Max throughput scheduling algorithm to improve system performance. This paper derives the frequency efficiency and fairness to compare the existing user scheduling algorithm with the proposed user scheduling algorithm. The proposed scheme shows better frequency efficiency and fairness than Max throughput in all situations. This paper contributes to the research for improving the system performance of 5G mobile communication technology, and I hope that it will help some of the ongoing standardization work.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.638-651
• /
• 2000

When the bandwidth resources in a packet-switched network are shared among sessions by MAX-MIN flow control each session is required to transmit its data into the network subject to the MAX-MIN fair rate which is solely determined by network loadings. This passive behavior of sessions if fact can cause seri-ous QoS(Quality of Service) degradation particularly for real-time multimedia sessions such as video since the rate allocated by the network can mismatch with what is demanded by each session for its QoS. In order to alleviate this problem we extend the concept of MAX-MIN fair bandwidth allocations as follows: Individual bandwidth demands are guaranteed if the network can accommodate them and only the residual network band-width is shared in the MAX-MIN fair sense. On the other hand if sum of the individual bandwidth demands exceeds the network capacity the shortage of the bandwidth is shared by all the sessions by reducing each bandwidth guarantee by the MAX-MIN fair division of the shortage. we present a novel flow control algorithm to achieve this extended MAX-MIN fairness and show that this algorithm can be implemented by the existing ATM ABR service protocol with minor changes. We not only analyze the steady state asymptotic stability and convergence rate of the algorithm by appealing to control theories but also verify its practical performance through simulations in a variety of network scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1979-1985
• /
• 1999

In this paper, we offer an analysis method for SL/D/1/K queueing system, where the shifting-level (SL) process proposed in the part I of this study[1]. Since an exact analysis of SL/D/1/K queueing system is very difficult, we propose an approximation method, where the queze sizes at input state transition epochs is quantized and thus the name 'quantization reduction method'. We provide the upper and lower bounds of the approximation for the system size distribution also, In addition, since the continuos version of well-known DAR(1) model is a kind of SL process with exponential correlation term only, the proposed method can be directly applied to the analysis of DAR(1)/D/1/K queueing system as well.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.799-806
• /
• 2020

The rapid growth of smartphone-to-Internet of Things (IoT) connections and the explosive demand for data usage centered on mobile video are increasing day by day, and this increase in data usage creates many problems in the IP system. In a full-based environment, in which information requesters focus on information providers to receive information from specific servers, problems arise with bottlenecks and large data processing. To address this problem, CCN networking technology, a future network technology, has emerged as an alternative to CCN networking technology, which reduces bottlenecks that occur when requesting popular content through caching of intermediate nodes and increases network efficiency, and can be applied to military information and communication networks to address the problem of traffic concentration and the use of various surveillance equipment in full-based networks, such as scientific monitoring systems, and to provide more efficient content.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.228-238
• /
• 2003

We believe that existing wire solutions such as HomePNA2.0 using phone lines and HomePlug using power line and wireless solution such as HomeRF are the most promising solutions, because of its cost-effectiveness. However, MAC protocols of these solutions provide only Class of Service(CoS) using priority mechanism like HomePNA and HomePlug or consider only voice among real-time traffics like HomeRF. For these reasons, we perceive the needs of the new MAC protocol which is no new wire solution and provides guaranteed Quality of Service (QoS) for not only voice but also video and audio. In light of this, we present the design and software implementation of a new MAC protocol for Home Networks. Our evaluation results of software implementation verify that proposed MAC protocol can provide low delay, low loss, and low jitter to real-time traffic by reserving bandwidth.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.923-930
• /
• 2016

Various pipes are used in the many industrial field such as water supply, drainage system and marine plants, so a maintenance of these pipes is essential. Especially, the maintenance of the piping in the industrial field, some professional staffs enter and clean the pipe. If the professional staffs can not enter and clean the pipe, the workers has to use the method of inserting a scraper connected to wire inside the pipe. However, this method demands huge budget and causes a number of problems such as traffic congestion. To solve these problems, pipe cleaning robot has been researching and developing. Many Pipe cleaning robots have a problem, that is impossible to confirm the operating condition of the robot in a real time. This paper suggest pipe cleaning robot with RS-485 which transmit operating and cleaning condition of robot and inner pipe filmed by camera, that user can check.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].