• Title/Summary/Keyword: Transfer waiting time

Search Result 48, Processing Time 0.022 seconds

A K Least Time Paths Searching Algorithm for Time Dependent Intermodal Transportation Networks with Departure Time Schedule Constraints (출발시간제약이 존재하는 동적 복합교통망의 K최소시간경로탐색)

  • Jo, Jong-Seok;Sin, Seong-Il;Mun, Byeong-Seop;Im, Gang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.3 s.89
    • /
    • pp.167-176
    • /
    • 2006
  • An minimum path algorithm for integrated networks with departure time constraints require considering arrival time of arriving mode, transfer time. waiting time, and departure time of next mode. Integrated network with diverse modes commonly include departure time constraints. Because public mode suck as train and airplane have fixed service schedule which provide passengers. This study developed the k-path algorithm in integrated network with time varying conditions and departure time constraints. We proposed the extended method based on entire path deletion method, and examined the application of the proposed algorithm through case study.

A Study on Type of Location Characteristics of Transfer Stations Using Data on Traffic Cards - Focused on Daegu City - (교통카드자료를 이용한 환승정류장의 유형별 입지특성에 관한 연구 - 대구시를 중심으로 -)

  • Kim, Ki-Hyuk;Lee, Seung-Cheol
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.31 no.4D
    • /
    • pp.519-526
    • /
    • 2011
  • In this study, the characteristics of transfer station are analyzed using the data of public transportation. The traffic card of Daegu does not include boarding information. The boarding data are calculated using traffic card data and the BMS data. It is found that transfer has increased by the distance from CBD and the numbers of routes, and decresed by the waiting time. Oneway ANNOVA are carried out to find the optimal number of clusters. Three clusters are chosen in this study. The center of the first cluster shows 2.99, so it has a characteristic of CBD. The second is 6.73, the outskirts of town, and the third is 12.78, the outlying areas.

PERIOD VARIATIONS OF RT PERSEI

  • Kim, Chun-Hwey
    • Journal of Astronomy and Space Sciences
    • /
    • v.12 no.2
    • /
    • pp.179-195
    • /
    • 1995
  • RT Per has been known as a close binary of which the orbital period has unpredictably varied so far. Although there are no agreements with the working mechanism for the changes of the period, two interpretations have been suggested and waiting for to be tested: 1) light-time effects due to the unseen 3rd and 4rd bodies (Panchatsaram 1981), 2) Abrupt period-changes, due to internal variations of the system (e.g. mass transfer or mass loss) superimposing to the light-time effect by a 3rd body (Frieboes-Conde & Herczeg 1973). In the point of view that the former interprepation models could predict the behavior of the changes of the orbital period theoretically, we checked whether the recent observed times of minimum lights follow the perdictions by the first model or not. We confirmed that the observed times of minimum lights have followed the variations calculated by the light-times effects due to the 3rd and 4rd bodies suggested by Panchatsatam. In this paper a total of 626 times of minimum lights were reanalyzed in terms of the light-time effects by the 3rd and 4rd bodies. We concluded that the eclipsing pair in SVCam system moves in an elliptic orbit about center of mass of the triple system with a period of about $42.^y2$, while the mass center of the triplet is in light-time orbit about the center of mass of the quadruple system with a period of $120^y$. The mean masses deduced for the 3rd and 4rd bodies were $0.89m_\odot$ and $0.82m_\odot$, respectively.

  • PDF

AN ANALYSIS OF MMPP/D1, D2/1/B QUEUE FOR TRAFFIC SHAPING OF VOICE IN ATM NETWORK

  • CHOI, DOO IL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.2
    • /
    • pp.69-80
    • /
    • 1999
  • Recently in telecommunication, BISDN ( Broadband Integrated Service Digital Network ) has received considerable attention for its capability of providing a common interface for future communication needs including voice, data and video. Since all information in BISDN are statistically multiplexed and are transported in high speed by means of discrete units of 53-octet ATM ( asynchronous Transfer Mode ) cells, appropriate traffic control needs. For traffic shaping of voice, the output cell discarding scheme has been proposed. We analyze the scheme with a MMPP/$D_1$, $D_2$/1/B queueing system to obtain performance measures such as loss probability and waiting time distribution.

  • PDF

An investigation of data transmission scheme using DSL modem (철도에서 DSL 모뎀을 사용한 데이터 전송에 관한 고찰)

  • Cho B. K.;Choi G. H.;Chang S. G.
    • Proceedings of the KSR Conference
    • /
    • 2004.06a
    • /
    • pp.1446-1448
    • /
    • 2004
  • Communication line used in the rail-road have different use from subscriber line in the public telecommunication. But, when an existing communication equipment is replaced, by applying new high-speed transfer technology, we can anticipate the increase of transmission rate and decrease of waiting time according to high-speed of communication line. cost reduction of infrastructure construction and maintenance/repair according to centralization of communication line and transmission equipment. In this study, the transmission scheme of several xDSL(Digital Subscriber Line) modems were compared and analyzed. The way of applying xDSL modem to the metal cable which is used in the JR(Japan Railroad) is analyzed. In addition, the result tested in railroad communication line was reviewed.

  • PDF

A Performance Analysis of TMN Systems Using Models of Networks of Queues, Jackson's Theorem, and Simulation

  • Hwang, Young-Ha;Chung, Sang-Wook;Lee, Gil-Haeng;Kim, Young-Il
    • ETRI Journal
    • /
    • v.24 no.5
    • /
    • pp.381-390
    • /
    • 2002
  • We analyze the performance of a telecommunications management network (TMN) system using models of networks of queues, Jackson's theorem, and simulation. TMN systems for managing public asynchronous transfer mode (ATM) networks generally have a four-level hierarchical structure consisting of a network management system, a few element management systems (EMSs), and several pairs of agents and ATM switches. We construct a Jackson's queuing network and present formulae to calculate its performance measures: distributions of queue lengths and waiting times, mean message response time, and maximum throughput. We perform a numerical analysis and a simulation analysis and compare the results.

  • PDF

A Study of Vehicle Operation Policy in Warehouse (창고에서의 이송장비 운영정책에 관한 연구)

  • Lee, Hue-On;Chae, Jun-Jae;Lee, Moon-Su
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.1
    • /
    • pp.1-8
    • /
    • 2011
  • Controlling industrial vehicle operated by human in warehouse was not simple since the information transfer for controlling the vehicle was not easy. However, as the technology for the WMS (Warehouse Management System) has been advanced and the PDA (Personal Digital Assistant) has come into wide use in a workplace, the control of man-operated vehicle became less difficult as do to AGVS (Automated Guided Vehicle System). This study examines the ways to improve the efficiency of warehouse operation through introducing rule of task assignment for the vehicles, particularly forklift. This study, basically, refer to AGV operation policy because a great number of studies for AGV dispatching rule have been done and the mechanism for the controlling vehicles is very similar. The workers in field prefer to simple dispatching rules such as Shortest Retrieval Time First (SRTF), Shortest Travel Time First (STTF), and Longest Waiting Time First (LWTF). However, these rules have potential disadvantage. Thus, several rules made up by combining rules mentioned above are introduced and these new rules use threshold value or evaluation formula. The effectiveness of these new rules are tested by simulation and the results are compared. This study proposes favorable dispatching rules for forklift in warehouse for the efficiency of the vehicle operation and stability of service level.

An Extension of PC based B$\'{e}$k$\'{e}$sy Audiometer to Support Client/Server Model (클라이언트/서버 모델을 지원하기 위한 PC 기반 B$\'{e}$k$\'{e}$sy 청력검사시스템의 확장)

  • Song, Bok-Deuk;Kang, Deok-Hun;Sim, Hye-Jin;Shin, Bum-Joo;Kim, Jin-Dong;Jeon, Gye-Rok;Wang, Soo-Geun
    • Journal of Information Technology Services
    • /
    • v.10 no.2
    • /
    • pp.259-269
    • /
    • 2011
  • The B$\'{e}$k$\'{e}$sy audiometer is used to determine not only hearing threshold but also assumption of recruit phenomenon and cause of disease. However, current B$\'{e}$k$\'{e}$sy audiometer takes an operational model, so called face-to-face model, in which model one audiometrist can assess only one subject at a time. As a result, the face-to-face model leads to high audiometrist's labor cost and long waiting time when there exist many subjects. To improve such weakness, this paper extends PC based B$\'{e}$k$\'{e}$sy audiometer to support client/server model in which model one audiometrist enables to concurrently access several subjects. As providing capabilities such as real-time transfer of assessment result, video monitoring of subject and video chat, the same effect as face-to-face model but overcomes weakness of face-to-face model.

An Optimal Container Deployment Policy in Fog Computing Environments (Fog Computing 환경에서의 최적화된 컨테이너 배포 정책)

  • Jin, Sunggeun;Chun, In-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.3
    • /
    • pp.1-7
    • /
    • 2021
  • Appropriate containers are deployed to cope with new request arrivals at Fog Computing (FC) hosts. In the case, we can consider two scenarios: (1) the requests may be queued until sufficient resources are prepared for the container deployments; (2) FC hosts may transfer arrived service requests to nearby FC hosts when they cannot accommodate new container deployments due to their limited or insufficient resources. Herein, for more employed neighboring FC hosts, arrived service requests may experience shorter waiting time in container deployment queue of each FC host. In contrast, they may take longer transfer time to pass through increased number of FC hosts. For this reason, there exists a trade-off relationship in the container deployment time depending on the number of employed FC hosts accommodating service request arrivals. Consequently, we numerically analyze the trade-off relationship to employ optimal number of neighboring FC hosts.

Next-Generation File Transfer Protocol Which support concurrent file transmissions effectively in Internet (인터넷에서 동시 파일 전송을 효과적으로 지원하는 NFTP의 설계 및 구현)

  • Choi, Jae-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1C
    • /
    • pp.90-95
    • /
    • 2002
  • Though the FTP(File Transfer Protocol) has been used widely and stable, It has the structural weakness that can't support current file transmissions so that we have to wait the completion of previous file transmission when try to transmit another file. If try to transmit multiple files concurrently using this FTP, It has to forking multiple FTP servers and clients in each user's PC and ISP's host machine it would result in the waist of memory, resource of network and the high workload of system. In order to solving previous problem, in this paper I have designed the new model of FTP which based on multi-thread and created NFTP(Next-Generation FTP)protocol so that may reduce the workload of system and support current file transmission effectively. I have implemented NFTP and also applied to real service, as a result It have provided reliable service by reducing the workload of system and saved the waiting time which would happened.