• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.12-22
• /
• 2000

This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.5
• /
• pp.232-242
• /
• 2002

In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.12
• /
• pp.17-27
• /
• 2011

Most of the previous mobility management protocols such as IETF MIPv4/6 and its variants standardized by the IETF do not support global seamless handover because they require partially changes of the existing network infrastructure. In this article, we propose a simple mobility management protocol (SMMP) which can support global seamless handover between homogeneous or heterogeneous wireless networks. To do this, the SMMP employs separate location management function as DMMS to support global user and service mobility and the bidirectional tunnels are dynamically constructed to support seamless IP mobility by using the IEEE MIH extension server, which is extended the IEEE 802.21 MIH standards. The detailed architecture and functions of the SMMP have been designed. Finally, the mathematical analysis and the simulation have been done. The performance results show the proposed SMMP outperforms the existing MIPv6 and HMIPv6 in terms of handover latency, packet loss, pear signal noise ratio (PSNR).

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.147-153
• /
• 2011

In this paper, we present a new video management technique using forward timeline to efficiently store and delete the videos on a local server. The proposed method is based on capturing the changing preference of the videos according to recentness, frequency, and playback length of the requested videos. For this purpose, we utilize the forward timeline which represents the time area within a number of predefined intervals. The local server periodically measures time popularity and request segment of all videos. Based on the measured data, time popularity and request segment, the local server calculates the mean time popularity and mean request segment of a video using forward timeline. Using mean time popularity and mean request segment of video, we estimate the ranking and allocated storage space of a video. The ranking represents the priority of deletion when the storage area of local server is running out of space and the allocated storage space means the maximum size of storage space to be allocated to a video. In addition, we propose an efficient storage space partitioning technique in order to stably store videos and present a time based free-up storage space technique using the expected variation of video data in order for avoiding the overflow on a local server in advance. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, our video management technique for local server provides the lowest user start-up latency and the highest bandwidth saving significantly.

• Journal of Korean Society of Transportation
• /
• v.33 no.1
• /
• pp.14-28
• /
• 2015

Numerous research has been conducted using internet search data since the mid-2000s. For example, Google Inc. developed a service predicting influenza patterns using the internet search data. The main objective of this study is to prove the hypothesis that highway traffic indices are similar to the internet search patterns. In order to achieve this objective, a model to predict the number of vehicles entering the expressway and space-mean speed was developed and the goodness-of-fit of the model was assessed. The results revealed several findings. First, it was shown that the Google search traffic was a good predictor for the TCS entering traffic volume model at sites with frequent commute trips, and it had a negative correlation with the TCS entering traffic volume. Second, the Naver search traffic was utilized for the TCS entering traffic volume model at sites with numerous recreational trips, and it was positively correlated with the TCS entering traffic volume. Third, it was uncovered that the VDS speed had a negative relationship with the search traffic on the time series diagram. Lastly, it was concluded that the transfer function noise time series model showed the better goodness-of-fit compared to the other time series model. It is expected that "Big Data" from the internet search data can be extensively applied in the transportation field if the sources of search traffic, time difference and aggregation units are explored in the follow-up studies.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.23-31
• /
• 2012

The objective of this study is to develop the design criteria of traffic island considering pedestrian level of service (LOS). In pursuing the above, this study gives particular emphasis to suggesting the minimum design space of traffic island in order to maintain pedestrian LOS C and D, and the critical pedestrian traffic volume that reflects the intersection geometry (2 lanes per direction) through the simulation analysis. The main results are as follows. First, the spaces of 160 traffic islands, which meet the pedestrian LOS C and D and reflects the pedestrian traffic volume by signal cycle, are drawn by using a commercial simulator VISSIM. The relevant spaces of traffic island in terms of both the pedestrian LOS and the pedestrian traffic volume are evaluated to range from $3.0m^2$ to $41m^2$. Second, the critical pedestrian traffic volume for the operation of traffic island is evaluated to be 1,000-1,300 person/hour at LOS C and 1,600-1,800 person/hour at LOS D, respectively, when a cycle of 120-150 seconds were applied to a intersection with two lanes per direction.

• Korean Journal of Soil Science and Fertilizer
• /
• v.41 no.4
• /
• pp.235-238
• /
• 2008

The Water Erosion Prediction Project (WEPP) was initiated in August 1985 to develop new generation water erosion prediction technology for federal agencies involved in soil and water conservation and environmental planning and assessment. Developed by USDA-ARS as a replacement for empirical erosion prediction technologies, the WEPP model simulates many of the physical processes important in soil erosion, including infiltration, runoff, raindrop detachment, flow detachment, sediment transport, deposition, plant growth and residue decomposition. The WEPP included an extensive field experimental program conducted on cropland, rangeland, and disturbed forest sites to obtain data required to parameterize and test the model. A large team effort at numerous research locations, ARS laboratories, and cooperating land-grant universities was needed to develop this state-of-the-art simulation model. The WEPP model is used for hillslope applications or on small watersheds. Because it is physically based, the model has been successfully used in the evaluation of important natural resources issues throughout the United State and in several other countries. Recent model enhancements include a graphical Windows interface and integration of WEPP with GIS software. A combined wind and water erosion prediction system with easily accessible databases and a common interface is planned for the future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.179-187
• /
• 2014

The underlay protocol is a cognitive radio method in which secondary or cognitive users use the same frequency without affecting the quality of service (QoS) for the primary users. In addition, because of the broadcast characteristics of the wireless environment, some nodes, which are called eavesdropper nodes, want to illegally receive information that is intended for other communication links. Hence, Physical Layer Security is applied considering the achievable secrecy rate (ASR) to prevent this from happening. In this paper, a performance analysis of the amplify-and-forward scheme under an interference constraint and Physical Layer Security is investigated in the cooperative communication mode. In this model, the relays use an amplify-and- forward method to help transmit signals from a source to a destination. The best relay is chosen using an opportunistic relay selection method, which is based on the end-to-end ASR. The system performance is evaluated in terms of the outage probability of the ASR. The lower and upper bounds of this probability, based on the global statistical channel state information (CSI), are derived in closed form. Our simulation results show that the system performance improves when the distances from the relays to the eavesdropper are larger than the distances from the relays to the destination, and the cognitive network is far enough from the primary user.

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.6
• /
• pp.591-596
• /
• 2019

In this paper, we implemented a deep learning operation structure with less influence of local PC performance. In general, the deep learning model has a large amount of computation and is heavily influenced by the performance of the processing PC. In this paper, we implemented deep learning operation using AWS and streaming server to reduce this limitation. First, deep learning operations were performed on AWS so that deep learning operation would work even if the performance of the local PC decreased. However, with AWS, the output is less real-time relative to the input when computed. Second, we use streaming server to increase the real-time of deep learning model. If the streaming server is not used, the real-time performance is poor because the images must be processed one by one or by stacking the images. We used the YOLO v3 model as a deep learning model for performance comparison experiments, and compared the performance of local PCs with instances of AWS and GTX1080, a high-performance GPU. The simulation results show that the test time per image is 0.023444 seconds when using the p3 instance of AWS, which is similar to the test time per image of 0.027099 seconds on a local PC with the high-performance GPU GTX1080.