• International Journal of Highway Engineering
• /
• v.20 no.4
• /
• pp.73-84
• /
• 2018

PURPOSES : Most of the traffic surveys are carried out by an inspection method by the manpower. In some cases, the video equipment is used only in some regions when the traffic volume is surveyed. In this case, there is environmental restriction that the road equipment to fix the video equipment should exist. Also, in areas where information such as digital maps and satellite photographs is old or not provided, they are forced to rely on manpower research, but it is difficult to put huge amounts of time and money into the research in places where labor supply and demand is difficult. This difficulty is particularly pronounced in overseas business. METHODS : The purpose of this study is to improve the efficiency of business by using the drones in the traffic investigation through analysis of the cost reduction effect between the existing method and the proposed method in the overseas business traffic survey. The scope of the research is limited to the scope of research, and based on the case of overseas projects, the method of using drone for each research sector is suggested. RESULTS : In the traffic condition survey section, we propose the use of drone for traffic survey and queue length survey, and it is confirmed that there is a cost saving effect of 16% ~ 27% compared with the existing method. In the road condition survey, we propose the use of drones for road surface linear survey, geometry survey, and obstacle survey, and it was confirmed that the cost reduction effect is 39% ~ 93% compared to the existing method. CONCLUSIONS : In addition to overseas business, it is expected that it will have a positive effect on research time and cost reduction by using drone in traffic survey in domestic area where labor supply is not easy or basic data is insufficient.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.973-982
• /
• 2004

High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.683-701
• /
• 2012

IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.31-43
• /
• 2002

Traffic signal control methods are suggested to improve the operational effectiveness of COSMOS system in Seoul. First. a method that improves progression of the corridor traffic flow within a common sub-area was explored. Applying this method, both frequency and magnitude of offset transition were reduced as compared to the existing method. In addition, the level of connection among neighboring corridors increased by applying the method, thus the qualify of progression was also improved. Second, a practical guideline on signal phase design was proposed to improve the efficiency of actuated operations for the left-turn movement. Last, a method for estimating optimal queue length parameters was surveyed and evaluated. An evaluation study was performed for the suggested methods through both field and simulation studies. Results showed that the proposed methods gave better performance than the existing methods. It is expected that the use of proposed methods can improve operational performance of COSMOS.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.61-68
• /
• 2008

Ethernet passive optical network (EPON) is the next-generation technology mitigating the bottleneck between high-capacity local area networks (LANs) and a backbone network. The bottleneck is aggrevated depending on burstiness and long range dependence (LRD) of traffic characteristics as well as amount of outgoing traffic from the high-capacity LANs. The proposed scheme decreases average packet delay for data upstreaming by considering such traffic characteristics to dynamically allocate bandwidth to multiple optical network units (ONUs). In addition, it can appropriately support delay-sensitive traffic such as constant bit ratio (CBR) traffic by making maximum cycle time fix regardless of the number of ONUs. The comprehensive simulation results indicate that the proposed scheme acheives up to 77% and 82% lower than previous schemes in terms of average packet delay and average queue size while it limits the maximum cycle time to twice of the basic cycle time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.8 no.5
• /
• pp.431-441
• /
• 1997

In this paper, a performance evaluation method for the Trunked Land Mobile Radio System, so called TRS(Trunked Radio System), is presented. The proposed evaluation method employs LCD(Lost Call Delayed) system model and Erlang-C distribution. In this system, queues are used to hold call requests that are initally blocked. When a user attempts a call and a channel is not immediately available, the call request may be delayed until a channel becomes available. For evaluating system performance, therefore, the probability that any caller is delayed in the queue for a waiting time greater than t seconds is derived and simulated by using such parameters as total number of available channels, traffic load and average duration of a call. Furthermore, the performance of the message and the transmission trunked channel assignment strategies is compared. The performance simulation results show that transmission trunking is shown to be more efficient than message trunking.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.111-120
• /
• 2017

This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems.

• Journal of Digital Convergence
• /
• v.16 no.1
• /
• pp.153-158
• /
• 2018

Fundamental problems of e-commerce are exaggerated advertising of products, lack of trust in products or suppliers, and false reviews. As a solution, I have merged the concept of trust service embedded in social network service(SNS) with commercial domain to develop a new type of service called "Reliable SNS Commerce Service". The contents developed in this paper are as follows: first, online community functions for users to provide services; second, commerce functions; and third, functions for linking SNS and commerce. Through the reliability information presented in this paper, the seller provides more reliable and objective purchase information to the buyer about the sales items, thereby contributing to the sales by increasing the probability of the actual purchase. The buyer can purchase the higher-quality products with confidence. The service providers can gain the reputation as a reliable site for purchasing members. In conclusion, this paper provides a positive effect to all the participants, which will contribute to the development of a new commerce market and activation of electronic commerce.