• Title/Summary/Keyword: route server

Search Result 70, Processing Time 0.022 seconds

Design and Implementation of The Efficient Andong Bus Route System using a Location Information (위치정보를 이용한 효율적인 안동 시내버스 노선 검색 시스템의 설계 및 구현)

  • Jang, Soo-Young;Lim, Yang-Won;Lim, Han-Kyu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.5
    • /
    • pp.45-54
    • /
    • 2011
  • Currently various applications related to bus route are used on smart devices to obtain bus arrival times, and route information. However, applications are unable to provide various ways for users to provide their destination. This study has designed an algorithm based on user's six patterns. An Android application and a server that communicate with each other have been based on the algorithm. The applications and the server use the Google Maps service and location-based information to provide users with possible routes from the starting place to the destination. They also provide user's with users' current position and any transfer information. They provide practical and efficient information, and are easy to use.

A Centralized QoS Routing Architecture with No Dynamic Network State Information Exchange Overhead (동적 네트워크 상태정보 교환 오버헤드를 제거한 중앙 집중적 QoS 라우팅 구조)

  • Kim, Sung-Ha;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.573-582
    • /
    • 2002
  • We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.

Development of Traceback System Using IDS Module (침입탐지 모듈을 이용한 역추적시스템 개발)

  • 김선영;구향옥;서동일;오창석
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.05a
    • /
    • pp.227-230
    • /
    • 2003
  • A system connected in Internet can be intruded by cracker via several systems. This paper proposes an efficient traceback model in order to trace a route of crackers. The traceback system is composed of a traceback server model and a traceback client model, As transmitting intrusion information from an area where client agent is installed to traceback server, the system distinguishes which systems are used as intrusion route. The traceback system can retrace intrusion route efficiently in an area where a traceback client is installed.

  • PDF

A Disaster Evacuation System Using Smart Devices for Indoor Crisis Management in BLE Environments (BLE 환경에서 실내 위기관리를 위한 스마트 장치 기반의 재난대피 시스템)

  • Jang, Minsoo;Jeong, Wooyong;Lim, Kyungshik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.5
    • /
    • pp.281-296
    • /
    • 2015
  • This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.

A Route Selection Scheme for WLAN Off-Loading in EPC Network with a Cloud Server (Cloud 서버를 포함한 EPC 망에서 WLAN 오프로딩 경로 선택)

  • Kim, Su-Hyun;Min, Sang-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2527-2532
    • /
    • 2013
  • There coexist various access network for mobile terminals, such as mobile phones, smart phones, and tablet PC, in mobile and wireless network. In these circumstance, the network traffic overload unexpected causes the service degradation or discontinuity. To solve this problem, we consider a off-loading route selection by a cloud server which monitors traffic volume and selects an appropriate route. With our proposed scheme, it is possible for the EPC network with untrusted WLAN access networks to operate efficiently to a trusted service level. Also, an optimal handover with satisfying service requirements could be achieved by the proposed offload scheme.

Developing Advanced Location-Based Route-Search Service for Smart-phones (진보된 스마트폰용 위치 기반 경로 검색 서비스 개발)

  • Pak, Woo-Guil;Lim, Sung-Man;Oh, Han-Joon;Yu, Kwang-Hyun;Kwon, Min-Young;Lee, Hee-Seung;Choi, Young-June
    • Journal of Internet Computing and Services
    • /
    • v.12 no.4
    • /
    • pp.173-180
    • /
    • 2011
  • Various smart-phone applications for location-based service are enabled through mobile communications such as 3G and WiFi. We have developed MARS, an advanced location-based route-search application based on the Android platform. It provides three functions: route-registration, route-search, and route-evaluation. These functions are dynamically maintained by a web server, a database server, and user mobile terminals. As users can update location information using their smart-phone devices, servers provide the information and allow users to add, modify, and remove their own information as well as adding comments to others, while existing map services do not support direct inputs from users. We show our implementation process and demonstration of its operations. We also show the comparison results with existing services. Through these results, we can confirm that MARS can achieve better performance.

Implementation of Android application to judge the daily route deviation via the GPS information on smart phones (스마트폰의 GPS 정보를 이용한 일상 경로 이탈 판단 어플리케이션 구현)

  • Cha, Kyung-Ae;Hyun, Sung-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.3
    • /
    • pp.27-34
    • /
    • 2013
  • As smart phone is daily used by most people, various location-based applications have been developed. Moreover, it is increased the requirements of location-based services that utilize Google maps, GPS sensing information and etc.. In this paper, we develop a smart phone application providing notification services by detecting the daily route deviation. We develop the server system which receives GPS information gathering from user's smart phone and analyse the user's regular routes. With the results from the analyzation the GPS coordinates, the application on a smart phone detects the case of a breakaway from regular routes. And then it can inform automatically and immediately the designed person such as guardians of children or the old and the infirm of the route deviation so will be helpful to protect such person. This is one example of the effectiveness of the application. Moreover, the application is developed on the client-server framework, thus it is very useful to judge the user's daily route deviation in realtime by using the accumulated information on the corresponding DB. Finally we evaluated the proposed methods which had been implemented on smart phones and show the utilities of the application.

A Study of a Seamless Handover between Near-Shore Area and a Harbor (근해 영역과 항구 사이의 Seamless 핸드오버에 관한 연구)

  • Ha, Sang Hyuk;Min, Sang Won;Park, Sun;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.3
    • /
    • pp.327-333
    • /
    • 2013
  • In this paper, we propose a QoS information collection method at the information server in maritime networks with multi-network interfaces, and a route selection scheme based of the measured predictive QoS information comparing with parameters requested from a mobile node in a ship entering into a harbor from near-shore area. By changing network conditions and applying various application bandwidths, we check the operation of our proposed scheme and measure its performance of the original and proposed schemes in the viewpoints of the received packet traffic and end-to-end delays.

Analysis of Inter-Domain Collaborative Routing: Provider Competition for Clients

  • Nicholes, Martin O;Chuah, Chen-Nee;Wu, Shyhtsun Felix;Mukherjee, Biswanath
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.499-510
    • /
    • 2011
  • Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.

A study on congesting control scheme for LAN interworkding in connectionless data service (비연결형 데이터 서비스에서 LAN연동을 위한 폭주 제어에 관한 연구)

  • 박천관;전병천;김영선
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.29-38
    • /
    • 1998
  • This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

  • PDF