• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.259-266
• /
• 2005

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• Journal of Korean Society of Transportation
• /
• v.30 no.2
• /
• pp.29-42
• /
• 2012

Recently, traffic congestion has become serious due to increase of private car usages. Carsharing or other innovative public transportation systems were developed to alleviate traffic congestion and carbon emissions. These measures can make the traffic environment more comfortable, and efficient. Cloud Transportation System (CTS) is a recent carsharing model. User can rent an electronic vehicles with various traffic information through the CTS. In this study, a concept, vision and scenarios of CTS are introduced. And, authors analyzed the location of CTS rental stations and estimated CTS demands. Firstly, we analyze the number of the population, employees, students and traffic volume in study areas. Secondly, the frequency and utilization time are examined. Demand for CTS in each traffic zone was estimated. Lastly, the CTS rental station location is determined based on the analyzed data of the study areas. Evaluation standard of the determined location includes accessibility and density of population. And, the number of vehicles and that of parking zone at the rental station are estimated. The result suggests that Haewoondae Square parking lot would be assigned 11 vehicles and 14.23 parking spaces and that Dongbac parking lot be assigned 7.9 vehicles and 10.29 parking spaces. Further study requires additional real-time data for CTS to increase accuracy of the demand estimation. And network design would be developed for redistribution of vehicles.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.293-300
• /
• 2007

As the development of the various IP-based services, it is expected that Internet telephony service will gradually replace the traditional PSTN-based telephony service. But there are many issues resolved to spread the Internet telephony service. One of them is to support the emergency services in the Internet telephony. In the case of USA, it has been regulated that 911 services should be supported in the Internet telephony services using VoIP on the similar performance level to PSTN 911 service. According to the regulation, basic VoIP 911 calls should be routed to the general access line of LEA without the location information or the callback number, but the enhanced VoIP 911 calls with the location information and callback number should be routed on the dedicated 911 network and destined to the local 911 distribution center such as PSAP. But, in the current VoIP-based Internet telephony network, the emergency call service has not been handled as one of the special services as well at has a worse performance in comparison to it on PSTN. Moreover, the service has a critical problem that it can not be destined to the nearest PSAP because of the insufficient information about the location information and the call back number. In this paper, we suggest the SIP-based emergency call service mechanism in order to resolve the problems above mentioned. This suggested mechanism is implemented to show its effectiveness and efficiency.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.6
• /
• pp.1-11
• /
• 2008

As bus is realized by economical, environmental transportation that is available mass transport than car, various policy for improvement of services is achieved. As innovative public transportation systems like BMS (Bus Management System) have established, it is possible to manage bus service efficiently. However, the present bus service management system mainly focuses on enhancing service reliability represented by schedule adherence index. This study discusses the necessity of a special management for bus bunching phenomena at stops, and develops two kinds of bus bunching indices based on the Number of Berth and the Average Bus Arrival Rate. The bus bunching indices were measured by utilizing the bus operational information from BMS at the Seoul TOPIS(Transportation & Information Service). In order to evaluate the sensitivity of the Indices, the indices were applied to two different bus groups: buses on exclusive bus median lane, and regular (shared) lanes. As analysis result, is bunching as is near in downtown and is bunching to peak time morning than the afternoon. Compared with the schedule adherence index, the suggested indices were proved as an efficient complementary indices in the evaluation of the bus operational performance. The results of index comparison between exclusive bus median lane and shared lanes can promote the expansion of exclusive bus median lane. Moreover, it can also be used as a reference in deciding bus station scale including the Number of Berth and the route adjustment plan.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1681-1698
• /
• 2011

According to the demands of the times, Inchon international airport railroad opened up step by step but It is situation that much government subsidies are paid because It does not competitive power with road traffic by decline of schedule speed. Inchon international airport railroad users will convert by other transportation and minimize damage their time as travel time is prolonged. Therefore, need high speedization of airport railroad, this may act big role competitive power security as well as airport railroad activation with another public transportation. Thus, this paper suggests that a high speedization possibility section in the sections of airport railroad and train speed elevation effect analysis by roadbed, railroad, system improvement and the most efficient operation intervals analyzing each vehicles (AREX (120km/h), KTX (230km/h), EMU(Electric Multiple Unit, 180km/h) train running pattern.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.650-664
• /
• 2000

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

• Journal of Gifted/Talented Education
• /
• v.26 no.2
• /
• pp.319-346
• /
• 2016

In this study, by examining the characteristics of boys and girls which would appear in the performance process of Goldberg machine activities, it would be attempted to provide the implications for the development and teaching methods of gifted and talented programs. The object of study was organized into separate 2 groups of boys and girls by each, composed of a total of 16 people among 5th graders of the gifted class in elementary school, located in Gyeonggi province. The final assignment was to make the Goldberg machine in order to have the beads get to the target spot latest, in which the analysis was implemented qualitatively by participating in and observing the performance process of students. After dividing the Goldberg machine activities into the steps of planning, production, outcome, assessment and reflection, their analysis results are as follows: First, in the planning stage, the girls explained minutely the process of Goldberg machine in writing, whereas the boys represented it visually simply. Second, in the production stage, the boys showed the task commitment by trying to realize the machine as designed initially, but the girls showed their appearance to represent it simply and easily. Third, in the sophistication and efficiency of the machine production, the boys were superior to the girls, and in the creativity and diversity of the use of materials, the girls were more excellent. Fourth, in the assessment and reflection, the boys evaluated it individually, and the girls showed their appearance to evaluate it by reflecting others'thinking. Hence, when developing and teaching the gifted and talented programs, it would be required that the teaching and learning contents be recomposed by considering the gender, or that the various class strategies be sought. Further, the broader and more systematic studies, on the performance process of gifted students based on the gender, should be carried out.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.