• Title/Summary/Keyword: access trip

Search Result 53, Processing Time 0.024 seconds

Comparative Study on the Departure Area for a Day's Tour Trip in Due Consideration of the Circular Trip among Tourist Attractions - Focused on Geoje-si Tourist before and after the Opening of BG Fixed Link - (관광지간 회유(回遊)행동을 고려한 당일관광통행 출발권역 비교연구 - 거가대로 개통 전후 거제 방문관광객을 대상으로 -)

  • Song, Ki-Wook;Jung, Hun-Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.35 no.5
    • /
    • pp.1103-1110
    • /
    • 2015
  • Ratio of a day's tour for Geoje-si, 22.6 percent, has increased to 48.6 percent since the opening of Busan-Geoje fixed link. Eight cities of Yeungnam area including Busan-Ulsan and Daegu-Gyeongbuk has been directly affected by the changed route from GJ Bridge to BG Bridge. In order to compare the range of departure area for a one-day trip in Geoje tourist attractions before and after the new fixed link, duration variation of visitors is described as individual difference by normal distribution function. One-day tour trip model based on a circular trip is also suggested under comparatively simple supposition. Since average area after the opening is equal to maximum area before as minimum area after is equal to average area before, the effect of access improvement by the new bridge is revealed definitely. In addition, the effect of cities located in the middle and long distance is greater. Although cities proximity to Geoje are not influenced significantly, every citizen is capable of taking a one-day trip anywhere.

Handoff Algorithm based on One-way Trip Time for Wireless Mesh Network (Wireless Mesh Network을 위한 OTT 기반 핸드오프 알고리즘)

  • Park, Cha-Hee;Yoo, Myung-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.16-24
    • /
    • 2007
  • Wireless mesh network extends the limited coverage of conventional wireless service from one-hop access point to wider area. It is recognized as an important issue to provide seamless handoff in the wide coverage of wireless mesh network. A long handoff delay may cause high packet loss and disconnection of service, degrading the network performance. The handoff delay is mainly introduced from the channel scanning process obtaining information to make handoff decision and the unnecessary handoffs due to inaccurate handoff decision. In this paper, we propose the handoff algorithm based on one-way trip time (OTT) to expedite the handoff procedure. As compared to the handoff algorithm based on the receiving signal power, the proposed algorithm takes advantage of OTT to obtain the necessary handoff information in a relatively shorter time and reduce the unnecessary handoffs. The performance of proposed algorithm is evaluated through the simulations. It is verified that the proposed handoff algorithm can effectively enhance the handoff accuracy, and therefore reduce the handoff delay and unnecessary handoffs.

Access timing offsets-resilient uplink OFDMA for satellite systems (액세스 타이밍 오차에 강한 위성 시스템 상향링크 OFDMA 기법)

  • Kim, Bong-Seok;Choi, Kwon-Hue
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.2
    • /
    • pp.92-96
    • /
    • 2010
  • We propose a new satellite OFDMA(Orthogonal Frequency Division Multiple Access) scheme with greatly enhanced tolerance of timing offset among the users. In uplink OFDMA systems, timing misalignment among users destroys subcarrier orthogonality and thus, it degrades the performance. In order to avoid this performance degradation, the accurate processing, so called 'ranging', is required to synchronize among users. However, ranging scheme is not available in the satellite systems due to the very long round trip delay. Exploiting the property that PSW(Propoerly Scrambled Walsh-code) code has zero correlation despite ${\pm}1$ chip timing offset, the proposed OFDMA achieves MAI free performance with the timing offset up to ${\pm}1$ OFDM symbol duration for the satellite systems.

Research on the Identification of Network Access Type of End-Hosts for Effective Network Management (효율적인 네트워크 자원 관리를 위한 호스트의 접속 유형 판별에 관한 연구)

  • Hur, Min;Kim, Myung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.11
    • /
    • pp.965-974
    • /
    • 2012
  • As the use of smart devices has become popular, the number of smart devices connected to network has increased and the amount of traffic from them has grown rapidly. The management of mobile traffic and IP address for smart devices in an enterprise network is crucial problem for efficient operation of network. The information about connection type of a terminal host to the network will be very useful for stable and efficient management of an enterprise network. Also, this information might be used to identify NAT device. In this paper, we propose a methodology to identify the connection type of a terminal host using RTT (Round-Trip-Time) value extracted from captured packets. We prove the feasibility of our proposed method in a target campus network.

Developing Web-based Virtual Geological Field Trip by Using Flash Panorama and Exploring the Ways of Utilization: A Case of Jeju Island in Korea (플래시 파노라마를 활용한 웹-기반 가상야외지질답사 개발 및 활용 방안 탐색: 제주도 화산 지형을 중심으로)

  • Kim, Gun-Woo;Lee, Ki-Young
    • Journal of the Korean earth science society
    • /
    • v.32 no.2
    • /
    • pp.212-224
    • /
    • 2011
  • In school science class, actual geological field trips tend to be restricted due to a number of problems including travel distance, cost, safety, and so on. Therefore, alternative way should be sought to provide students with the benefits of actual field trip. The purpose of this study is to develop web-based virtual field trip (VFT) about Jeju island in Korea by using flash panorama, and to explore a variety of ways to utilize the VFT. The characteristics of Jeju VFT are as follows: it provides virtual space for secondary school students to learn about volcanic topography and geology; students can access contents in a non-sequential order by virtue of web-based system, and students can control learning pace according to their ability; it is possible to investigate the same field site repeatedly, not limited by time and space; it presents differentiated worksheets for different school grade; it provides diverse complementary web contents, e. g., closeup features, thin sections, inquiry questions, and explanations of outcrops. We proposed several ways with instructional models to utilize Jeju VFT in science class and extra-school curricular as well.

An Empirical Study on Comparative Analysis of Freight Demand Estimation Methods - Unimodal O/D Based Method and P/C Based Method : Focus on Korean Import/Export Container Freight (수단O/D기반 및 P/C기반 화물수요추정방식의 실증적 비교: 우리나라 컨테이너 화물을 중심으로)

  • Kim, Hyunseung;Park, Dongjoo;Kim, Chansung;Choi, Chang Ho;Cho, Hanseon
    • Journal of Korean Society of Transportation
    • /
    • v.31 no.2
    • /
    • pp.45-59
    • /
    • 2013
  • This study deals with the comparative analysis between two freight demand estimation methods : Unimodal O/D based method and P/C based method. The data of access/egress truck trips has been omitted from the Korean freight unimodal O/D of KTDB. This is because KTDB's unimodal O/D has not marked the series of unlinked trips down as the whole freight intermodal transport and surveyed only the main-haul trips of them. For these reasons, freight intermodal transport mechanism has not been analysed perfectly with Korean unimodal O/D data. This study tries to estimate P/C table of Korean Import/Export container freight and develop the MCC(Multimodal Channel Choice) model. Then, comparing unimodal O/D based method and P/C based method in terms of the switch commodities between production point(the initial point of freight transport) and consumption point(the terminal point of freight transport), unimodal commodities, and commodities on links is conducted. The results show that the P/C based method is able to simulate the freight intermodal transport.

MARS: Multiple Access Radio Scheduling for a Multi-homed Mobile Device in Soft-RAN

  • Sun, Guolin;Eng, Kongmaing;Yin, Seng;Liu, Guisong;Min, Geyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.79-95
    • /
    • 2016
  • In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.

A Satellite Radio Interface for IMT-2000

  • Lim, Kwang-Jae;Choi, Kwon-Hue;Kang, Kun-Seok;Kim, Soo-Young;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.24 no.6
    • /
    • pp.415-428
    • /
    • 2002
  • This paper presents a new satellite radio interface, satellite code division multiple access (SAT-CDMA), for the satellite component of IMT-2000. The SAT-CDMA was proposed by Korea and was based on wideband CDMA (WCDMA) for a high degree of commonality with the terrestrial component of IMT-2000. Because a satellite link has a longer round trip delay and a higher Doppler shift than a terrestrial link, we developed new technologies that would make the satellite component especially efficient. We present the main features of the SAT-CDMA radio interface by focusing on satellite-specific schemes. We also demonstrate with extensive comparison results the performance of the main technologies in the SAT-CDMA radio interface.

  • PDF

Adaptive Rate Control Scheme for Streaming-based Content Sharing Service

  • Lee, Sunghee;Chung, Kwangsue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.784-799
    • /
    • 2013
  • This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

An Efficient Mutual Exclusion Algorithm for Hypercube Multicomputers (하이퍼큐브 멀티컴퓨터를 위한 효율적인 상호 배제 알고리즘)

  • Bae, Ihn-Han
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.5
    • /
    • pp.1207-1214
    • /
    • 1996
  • We present an efficient decentralized, symmetric mutual exclusion algorithm for the hypercube architecture. The algorithm is based on the technique which embeds a mesh into a hypercube. We compare the performance of our algorithm with that of Gupta et al.'s algorithm. As a result of performance comparison, the minimum round-trip delay is equal to that of Gupta et al.'s algorithm, the average blocking delay is a little longer than that of Gupta et al.'s algorithm, and the number of messages per access to critical resource is fewer than that of Gupla et al.'s algorithm.

  • PDF