• IE interfaces
• /
• v.17 no.1
• /
• pp.121-127
• /
• 2004

In this paper, we present the base station(BS) processing capacity to provide the multimedia services in IMT-2000 wireless communication network. The IMT-2000 services are classified into two types, circuit and packet services, and user‘s environments such as indoor, pedestrian and vehicle are considered. Using the parameters of service economics and wireless technology, the user's reference traffic and BS‘s traffic are computed. The traffic is measured by throughput(kbps). Based on the measured traffic, the accommodating users in BS are also evaluated. In addition to, the BS design capacity is presented for varying the number of users and traffic distribution in different user's environments.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.679-690
• /
• 2011

In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.362-364
• /
• 2018

Predicting network traffic volume has become a popular topic recently due to its support in many situations such as detecting abnormal network activities and provisioning network services. Especially, predicting the volume of the next upcoming traffic from the series of observed recent traffic volume is an interesting and challenging problem. In past, various techniques are researched by using time series forecasting methods such as moving averaging and exponential smoothing. In this paper, we propose a long short-term memory neural network (LSTM) based network traffic volume prediction method. The proposed method employs the changing rate of observed traffic volume, the corresponding time window index, and a seasonality factor indicating the changing trend as input features, and predicts the upcoming network traffic. The experiment results with real datasets proves that our proposed method works better than other time series forecasting methods in predicting upcoming network traffic.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.39-43
• /
• 2006

In this paper, we proposed TASL-MAC, a medium-access control (MAC) protocol for wireless sensor networks. In wireless sensor networks, sensor nodes are usually deployed in a special environment, are assigned with long-term work, and are supported by a limited battery. As such, reducing the energy consumption becomes the primary concern with regard to wireless sensor networks. At the same time, reducing the latency in multi-hop data transmission is also very important. In the existing research, sensor nodes are expected to be switched to the sleep mode in order to reduce energy consumption. However, the existing proposals tended to assign the sensors with a fixed Sleep/Listening schedule, which causes unnecessary idle listening problems and conspicuous transmission latency due to the diversity of the traffic-load in the network. TASL-MAC is designed to dynamically adjust the duty listening time based on traffic load. This protocol enables the node with a proper data transfer rate to satisfy the application's requirements. Meanwhile, it can lead to much greater power efficiency by prolonging the nodes' sleeping time when the traffic. We evaluate our implementation of TASL-MAC in NS-2. The evaluation result indicates that our proposal could explicitly reduce packet delivery latency, and that it could also significantly prolong the lifetime of the entire network when traffic is low.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.287-296
• /
• 2015

Recent navigation systems provide quick guide services, based on processing real-time traffic information and past traffic information by applying predictable pattern for traffic information. However, the current pattern for traffic information predicts traffic information by processing past information that it presents an inaccuracy problem in particular circumstances(accidents and weather). So, this study presented a more precise predictive traffic information system than historical traffic data first by analyzing route search data which the drivers ask in real time for the quickest way then by grasping traffic congestion levels of the route in which future drivers are supposed to locate. First results of this study, the congested route from Yang Jae to Mapo, the analysis result shows that the accuracy of the weighted value of speed of existing commonly congested road registered an error rate of 3km/h to 18km/h, however, after applying the real predictive traffic information of this study the error rate registered only 1km/h to 5km/h. Second, in terms of quality of route as compared to the existing route which allowed for an earlier arrival to the destination up to a maximum of 9 minutes and an average of up to 3 minutes that the reliability of predictable results has been secured. Third, new method allows for the prediction of congested levels and deduces results of route searches that avoid possibly congested routes and to reflect accurate real-time data in comparison with existing route searches. Therefore, this study enabled not only the predictable gathering of information regarding traffic density through route searches, but it also made real-time quick route searches based on this mechanism that convinced that this new method will contribute to diffusing future traffic flow.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1061-1064
• /
• 2007

네트워크의 효율적인 관리를 위해서는 네트워크의 각 호스트에서 발생하는 트래픽을 실시간으로 모니터링 할 수 있는 시스템이 필요하다. 이러한 모니터링의 효율적인 방법 중 하나가 네트워크 장비에서 제공하는 flow 정보를 이용하는 방법이다. 하지만 이는 네트워크 장비의 과부하 발생, 운용비용 상승, 유연성 및 확장성 부족의 단점을 가진다. 이를 극복하기위하여 본 논문에서는 Enterprise 네트워크에 적합한 Flow 기반 실시간 트래픽 모니터링 시스템의 구조를 제안하고, 검증을 위해 구현한 내용을 기술한다. 본 시스템은 패킷을 수집하여 실시간으로 flow 정보를 생성하고 저장하는 Flow Generator 시스템, 저장된 flow 정보를 Analysis 시스템으로 전송하는 Flow Exporter 시스템, Traffic Analysis 시스템, 그리고 분석된 내용을 보여주는 Traffic Reporter 시스템으로 구성된다. 본 시스템은 다양한 분석 목적에 맞게 Flow 정보를 조절할 수 있는 유연성과 다양한 분석시스템을 구축할 수 있는 확장성을 가진다. 본 논문에서 기술한 시스템은 학교 Campus 네트워크를 대상으로 구축되었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.645-648
• /
• 2003

This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lends, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a large size in the image. The recognition algorithm is designed by intensively using built in functions of an off-the-shelf mage processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.471-476
• /
• 2004

This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lends, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a large size in the image. The recognition algorithm is designed by intensively using built in functions of an off-the-shelf image processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.667-676
• /
• 1995

In ATM traffic multiplexing, the cell clumping and the cell dispersion are occured due to the cell delay variance(CDV) which changes the traffic characteristics. These cell variances increase the burstiness of t.he cell streams and make the network congested. The function of the traffic shaping is necessary to transmit the input streams into the networks or into the traffic policing schemes with some intevals. Most of the existing studies regard the input traffics as the traffic with the identical characteristics. In this study, the traffic shaping is processed by considering the traffic characteristICS with t.he loss-sensitive traffic and the delay-sensitive traffic. The traffic shaping model and the traffic shaping algorithm which considers the" characteristics of input streams have been presented. The traffic effect On t.he CDV size is also studied. The proposed scheme is compared to Virtual Scheduling Algorithm(VSA) and the efficiency of the proposed scheme is evaluated. According to the simulation results, t.he mean delay is decreased about 12% in delay-sensitive traffic and the traffic burstiness is decreased about 11 % in loss-sensitive traffic.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1797-1803
• /
• 1997

Message handling function of the SS7(Signaling System N0.7) provides signaling traffic routing capabilities to transfer the signaling traffic to the destination nodes in the signaling network. This message handling function should be handled without any transfer delay for real time processing of large amount of signaling traffic for data communication service, and visual information service. In this paper, we suggest two routing algorithms working on the distributed message handling processors which were specially designed for message handling function. The one is an internal distributing algorithm for equal distribution of signaling traffic among the distributed message handling processors and the other is a distributing algorithm for distribution of signaling traffic in the multiple signaling routes. Both of algorithms are using signaling link selection codes labled in each signaling messages. It is shown that the suggested algorithms are very efficient for routing signaling traffic at the fault condition of signaling routes and the restoration of unavailable signaling routes.