• Title/Summary/Keyword: Search Traffic

Search Result 259, Processing Time 0.028 seconds

Architecture and Server Selection for DHT-based Distributed CDN (해시 테이블 기반 분산형 CDN 구조 및 서버 선택 방안)

  • Jung, Jong-Hae;Oh, Gun-Young;Lee, Nam-Kyung;Yoon, Chang-Woo;Lee, Hyun-Woo;Ryu, Won;Lee, Sung-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.217-228
    • /
    • 2011
  • In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

Search of Beacon in Low Power Wireless Interface (저전력 무선접속에서 비콘 탐색)

  • Song, Myong-Lyol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4A
    • /
    • pp.365-372
    • /
    • 2007
  • In IEEE 802.11b wireless network, stations synchronize themselves to the beacons periodically sent by the access point(AP) when they are running in low power mode. In case of missing beacon due to noise or traffic from neighboring wireless network stations must be awake until they get the next beacon, which causes energy consumption in stations. In this paper, we propose a scheme searching next beacon consuming little energy. The problems of missing beacon in low power mode of IEEE 802.11b wireless interface are described and a new method to reduce energy consumption is proposed. The proposed method is simulated with the network simulator, ns2, and compared with the low power mode of the IEEE 802.11b. The result measured in terms of station's wakeup time shows some enhancement in energy consumption when some errors occur in receiving frames.

Study on Subsurface Collapse of Road Surface and Cavity Search in Urban Area (도심지 노면하부 지반함몰 및 공동탐사 사례 연구)

  • Chae, Hwi-Young
    • Tunnel and Underground Space
    • /
    • v.27 no.6
    • /
    • pp.387-392
    • /
    • 2017
  • Recently, road cave-ins, also referred to as ground sinking, have become a problem in urban environments. Public utility facilities such as sewage pipelines, communications pipes, gas pipes, power cables, and other types of underground structures are installed below the roads. It was reported that cave-ins are caused by the aging and lack of proper maintenance of underground facilities, as well as by construction problems. A road cave-in is first initiated by the formation of cavities typically induced by the breakage of underground pipelines. The cavities then grow and reach the base of the pavement. The traffic load applied at the surface of the roads causes an abrupt plastic deformation. This type of accident can be considered as a type of disaster. A road cave-in can threaten both human safety and the economy. It may even result in the loss of human life. In the city of Seoul, efforts to prevent damage before cave-ins occur have been prioritized, through a method of discovering and repairing joints through the 3D GPR survey.

Management of Traumatic Pancreas Injury in Korea: Literature Review (한국에서 외상성 췌장 손상의 치료에 대한 문헌 고찰)

  • Lee, Seung Hwan;Jang, Ji Young;Shim, Hongjin;Lee, Jae Gil
    • Journal of Trauma and Injury
    • /
    • v.26 no.3
    • /
    • pp.207-213
    • /
    • 2013
  • Purpose: Traumatic pancreas injuries are rare conditions that result in high morbidity and mortality. Thus, early diagnosis and intervention are very important to manage pancreatic injuries. The purpose of this study is to review the management and outcomes of the pancreatic injuries in the Korean population. Methods: Original articles published from January 2001 to December 2012 and addressing the Korean population were selected by using indices such as 'pancreas injury', 'traumatic pancreas injury', and 'pancreatic trauma' to search KoreaMed and PubMed. Nine reports were selected to review the management options for surgery or endoscopic retrograde cholangio-pancreatography. We assessed the injury mechanisms, injury severities, associated injuries, types of operation, and outcomes. Results: Two hundred fifty of the 332 patients included in the 9 selected reports were men, and the mean age of all patients was 36.4 years. The main injury mechanism was traffic accidents(65.6%). Most patients had grade II or III injuries(68.9%). The most common extra-pancreatic injury site was the liver, followed by the chest and spleen. Operative management, including distal pancreatectomies(129), drainage procedures(64), pancreaticoduodenectomies(23), and others(60), was used for 276 patients. The reported mortality rate was 10.2%, and the morbidity rate ranged from 38% to 76.9%. The average length of hospital stay was 39.5 days. Risk factors for mortality were amount of transfusion, injury severity, base deficit, age, and presence of shock. Conclusion: In this study, we found neither significant data nor a consensus. If national guidelines are to be developed and established, a national data bank or registry, and nationwide data collection are required.

Worst Case Scenario Generation on Vehicle Dynamic Stability and Its Application (주행 안정성을 고려한 최악 상황 시나리오 도출 및 적용)

  • Jung, Dae-Yi;Jung, Do-Hyun;Moon, Ki-Hyun;Jeong, Chang-Hyun;Noh, Ki-Han;Choi, Hyung-Jeen
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.16 no.6
    • /
    • pp.1-9
    • /
    • 2008
  • The current test methods are insufficient to evaluate and ensure the safety and reliability of vehicle system for all possible dynamic situation including the worst case such as rollover, spin-out and so on. Although the known NHTSA J-turn and Fish-hook steering maneuvers are applied for the vehicle performance assessment, they aren't enough to estimate other possible worst case scenarios. Therefore, it is crucial for us to verify the various worst cases including the existing severe steering maneuvers. This paper includes the procedure to search for other useful worst case based upon the existing worst case scenarios mentioned above and its application in simulation basis. The only human steering angle is selected as a design parameter here and optimized to maximize the index function to be expressed in terms of either roll angle or yaw rate. The obtained scenarios were enough to generate the worst case to meet NHTSA worst case definition (ex.2-inch wheel lift). Additionally, as an application, the worst case steering maneuver is acquired for the vehicle to operate with a simple ESP system. It has been concluded that the new procedure in this paper is adequate to create other feasible worst case scenarios for a vehicle system both with an intelligent safety control system and without it.

Design and Implementation of the Postal Route Optimization System Model (우편 경로 최적화 시스템 모델 설계 및 구현)

  • Nam, Sang-U
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1483-1492
    • /
    • 1996
  • In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).

  • PDF

Railway Timetable Considering Optimal Path Finding Method in Rail Network (Focused on Revenue Allocation) (열차스케줄을 고려한 도시철도 이용객의 통행행태 추정 (수입금 정산사례를 중심으로))

  • Lee, Chang-Hun;Shin, Seong-Il;Kim, Si-Gon
    • Journal of the Korean Society for Railway
    • /
    • v.18 no.2
    • /
    • pp.149-156
    • /
    • 2015
  • It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

Test Item Prioritizing Metrics for a Selective Software Testing (차별화된 소프트웨어 시험을 위한 시험항목 우선순위 조정)

  • Lee, Jae-Ki;Lee, Jae-Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1B
    • /
    • pp.38-47
    • /
    • 2008
  • The system test was accomplished in delivery time for a suitable of various requirements at the software market. Especially, critical faults must be detected and removed for a close main functions and users against target system. In generally, proposed test methods are executed with a calendar time, not a competitive and effectiveness method as selective software testing. These methods are inapplicable to short term test or early system development stage. Moreover, it's accompanied by heavy cost. Overcoming of these problems, must attempted to new software test method role of core function in the system test. Selective software testing method is decided to mixing with the three-information such as a frequency, complexity of use scenario and fault impact. Using this information, searching a fatal error and usefully system test for an executed test scenario. In this paper, we have proposed new test method and verified testing results for the detection of critical faults or search a fatal errors with a system main function.

Discovery of Frequent Sequence Pattern in Moving Object Databases (이동 객체 데이터베이스에서 빈발 시퀀스 패턴 탐색)

  • Vu, Thi Hong Nhan;Lee, Bum-Ju;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.179-186
    • /
    • 2008
  • The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.

An Unified Spatial Index and Visualization Method for the Trajectory and Grid Queries in Internet of Things

  • Han, Jinju;Na, Chul-Won;Lee, Dahee;Lee, Do-Hoon;On, Byung-Won;Lee, Ryong;Park, Min-Woo;Lee, Sang-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.9
    • /
    • pp.83-95
    • /
    • 2019
  • Recently, a variety of IoT data is collected by attaching geosensors to many vehicles that are on the road. IoT data basically has time and space information and is composed of various data such as temperature, humidity, fine dust, Co2, etc. Although a certain sensor data can be retrieved using time, latitude and longitude, which are keys to the IoT data, advanced search engines for IoT data to handle high-level user queries are still limited. There is also a problem with searching large amounts of IoT data without generating indexes, which wastes a great deal of time through sequential scans. In this paper, we propose a unified spatial index model that handles both grid and trajectory queries using a cell-based space-filling curve method. also it presents a visualization method that helps user grasp intuitively. The Trajectory query is to aggregate the traffic of the trajectory cells passed by taxi on the road searched by the user. The grid query is to find the cells on the road searched by the user and to aggregate the fine dust. Based on the generated spatial index, the user interface quickly summarizes the trajectory and grid queries for specific road and all roads, and proposes a Web-based prototype system that can be analyzed intuitively through road and heat map visualization.