• Title/Summary/Keyword: Dynamic Server Information

Search Result 308, Processing Time 0.03 seconds

Dynamic Computation Offloading Based on Q-Learning for UAV-Based Mobile Edge Computing

  • Shreya Khisa;Sangman Moh
    • Smart Media Journal
    • /
    • v.12 no.3
    • /
    • pp.68-76
    • /
    • 2023
  • Emerging mobile edge computing (MEC) can be used in battery-constrained Internet of things (IoT). The execution latency of IoT applications can be improved by offloading computation-intensive tasks to an MEC server. Recently, the popularity of unmanned aerial vehicles (UAVs) has increased rapidly, and UAV-based MEC systems are receiving considerable attention. In this paper, we propose a dynamic computation offloading paradigm for UAV-based MEC systems, in which a UAV flies over an urban environment and provides edge services to IoT devices on the ground. Since most IoT devices are energy-constrained, we formulate our problem as a Markov decision process considering the energy level of the battery of each IoT device. We also use model-free Q-learning for time-critical tasks to maximize the system utility. According to our performance study, the proposed scheme can achieve desirable convergence properties and make intelligent offloading decisions.

Mobile RSS System for Dynamic Contents Syndication (동적 Content 배포를 위한 모바일 RSS 시스템)

  • Shim, Ki-Taek;Jeong, Jong-Il;Shin, Dong-Kyoo;Shin, Dong-Il;Yoo, Su-In;Yun, Jeong-Hee;Oh, Hyun-Mok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.411-414
    • /
    • 2007
  • 본 논문에서는 Content의 배급 및 구독을 위해 등장한 시맨틱 웹의 대표적인 기술인 RSS 를 통하여 모바일 환경에서의 사용자가 원하는 Content를 전달 받을 수 있는 시스템을 제안하고 있다. 이 시스템은 DCD Server를 사용하여 각 Content에 대한 정보를 담고 있게 되며, UDDI를 이용하여 사용자가 원하는 Content를 키워드 검색으로 통해 지정할 수 있게 된다. 또한 사용자가 선택한 각각의 Content는 RSS를 통하여 사용자의 모바일 Client로 전달되게 된다.

  • PDF

Dynamic Load Balancing of Virtual Machines in Server Virtualization Environments (서버 가상화 환경에서의 VM 로드 밸런싱 기법)

  • Oh, Wonsuk;Kim, Inhyuk;Eom, Young-Ik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1822-1825
    • /
    • 2010
  • 기업의 데이터 센터의 규모가 커지면서 서버 가상화가 중요한 이슈가 되고 있다. 하지만, 서버의 효율성을 높이기 위해 제안된 가상화 환경의 특징은 가상 머신 내부에서 실제 시스템 사용률을 측정하는데 어려움을 초래했다. 이는 외부에서 가상 머신이 동작중인 물리 머신의 부하를 잘못 인식하게 만들며, 기존 로드 밸런싱 기법 적용의 효율성을 저하시킨다. 이러한 문제를 해결하기 위해 본 논문에서는 가상 머신의 I/O 요청의 총량에 기반을 둔 로드 밸런싱 기법을 제안한다. 제안하는 기법에서 로드밸런싱 서버는 각각의 물리 서버의 I/O 처리량의 한계값을 알고 있으며, 한계값보다 낮은 I/O 요청이 있는 물리 서버에 속한 가상 머신에게만 작업을 분배한다.

Medical Information Dynamic Access System in Smart Mobile Environments (스마트 모바일 환경에서 의료정보 동적접근 시스템)

  • Jeong, Chang Won;Kim, Woo Hong;Yoon, Kwon Ha;Joo, Su Chong
    • Journal of Internet Computing and Services
    • /
    • v.16 no.1
    • /
    • pp.47-55
    • /
    • 2015
  • Recently, the environment of a hospital information system is a trend to combine various SMART technologies. Accordingly, various smart devices, such as a smart phone, Tablet PC is utilized in the medical information system. Also, these environments consist of various applications executing on heterogeneous sensors, devices, systems and networks. In these hospital information system environment, applying a security service by traditional access control method cause a problems. Most of the existing security system uses the access control list structure. It is only permitted access defined by an access control matrix such as client name, service object method name. The major problem with the static approach cannot quickly adapt to changed situations. Hence, we needs to new security mechanisms which provides more flexible and can be easily adapted to various environments with very different security requirements. In addition, for addressing the changing of service medical treatment of the patient, the researching is needed. In this paper, we suggest a dynamic approach to medical information systems in smart mobile environments. We focus on how to access medical information systems according to dynamic access control methods based on the existence of the hospital's information system environments. The physical environments consist of a mobile x-ray imaging devices, dedicated mobile/general smart devices, PACS, EMR server and authorization server. The software environment was developed based on the .Net Framework for synchronization and monitoring services based on mobile X-ray imaging equipment Windows7 OS. And dedicated a smart device application, we implemented a dynamic access services through JSP and Java SDK is based on the Android OS. PACS and mobile X-ray image devices in hospital, medical information between the dedicated smart devices are based on the DICOM medical image standard information. In addition, EMR information is based on H7. In order to providing dynamic access control service, we classify the context of the patients according to conditions of bio-information such as oxygen saturation, heart rate, BP and body temperature etc. It shows event trace diagrams which divided into two parts like general situation, emergency situation. And, we designed the dynamic approach of the medical care information by authentication method. The authentication Information are contained ID/PWD, the roles, position and working hours, emergency certification codes for emergency patients. General situations of dynamic access control method may have access to medical information by the value of the authentication information. In the case of an emergency, was to have access to medical information by an emergency code, without the authentication information. And, we constructed the medical information integration database scheme that is consist medical information, patient, medical staff and medical image information according to medical information standards.y Finally, we show the usefulness of the dynamic access application service based on the smart devices for execution results of the proposed system according to patient contexts such as general and emergency situation. Especially, the proposed systems are providing effective medical information services with smart devices in emergency situation by dynamic access control methods. As results, we expect the proposed systems to be useful for u-hospital information systems and services.

Design and Implementation of Dynamic Peer Selection Scheme for Allocating Proxy-Server on Pure P2P Network Environments (순수 P2P 네트워크 환경에서 프락시-서버 할당을 위한 동적 피어 선정 기법 설계 및 구현)

  • Kim, Young-Jin;Kim, Moon-Jeong;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.1
    • /
    • pp.153-160
    • /
    • 2003
  • Recently, deployments of firewalls and NATs ire increasing to provide network security features or to solve the problem of public IP shortage. But, in these environments, peers in different firewall or NAT environments may get limited services because they cannot open direct communicate channels. This can be a significant problem in pure P2P environments where the peers should get or provide services by opening direct channels among themselves. In this paper, we propose a scheme for dynamically selecting a peer that fan be used as a proxy server. The proxy server supports the communication between the peers in different firewall or NAT environments. The proposed scheme is operating system independent and supports bidirectional communication among the peers in P2P environments. Additionally, the proposed scheme can distribute network traffic by dynamically allocating proxy servers to the peers that is not located in the firewall or NAT environments.

Optimal TCP Segment Size for Mobile Contents Server Access over Wireless Links of Cellular Networks (이동통신망에서의 모바일 컨텐츠 서버 통신을 위한 최적의 TCP 세그먼트 길이)

  • Lee, Goo-Yeon;Jeong, Choong-Kyo;Kim, Hwa-Jong;Lee, Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.31-41
    • /
    • 2006
  • Internet access from mobile phones over cellular networks suffer from severe bandwidth limitations and high bit error rates over wireless access links. Tailoring TCP connections to best fit the characteristics of this bottleneck link is thus very important for overall performance improvement. In this work, we propose a simple algorithm in deciding the optimal TCP segment size to maximize the utilization of the bottleneck wireless TCP connection for mobile contents server access, taking the dynamic TCP window variation into account. The proposed algorithm can be used when the product of the access rate and the propagation time is not large. With some numerical examples, it is shown that the optimal TCP segment size becomes a constant value when the TCP window size exceeds a threshold. One can set the maximum segment size of a wireless TCP connection to this optimal segment size for mobile contents server access for maximum efficiency on the expensive wireless link.

An Architecture and Experimentation for Efficient and Reliable Name Service Systems (효율적이고 신뢰성 있는 네임 서비스 시스템의 구조 및 실험)

  • 심영철;박준철;강호석;이준원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.375-390
    • /
    • 2004
  • Domain Name System(DNS), one of the most important Internet services, handles mapping from host names to Internet addresses and vice versa, and precedes many Internet applications such as Web, e-mail, file transfer, etc. In this paper, we propose a structural design of a generic name server system providing name services for a huge domain for the purpose of improving the performance as well as the reliability of the system. We demonstrate the validity of the design by implementing and running a testbed system. Our testbed employs a couple of master name sowers for distributing the service overhead over two, rather than one, servers and for achieving high availability of the system as a whole. We suggest the use of dynamic update to add and delete records from a zone for which the name server has authority. The slave name servers located remotely then get a new, updated copy of the zone via incremental zone transfers(IXFRs). The experiments with the implemented testbed show that the proposed structure would easily manage increasing demands on the server power, and be highly available in the face of transient faults of a module in the system.

An Agent System for Efficient VOD Services on Web (효율적 웹 기반 VOD 서비스를 위한 에이전트 시스템)

  • Lee Kyung-Hee;Han Jeong-Hye;Kim Dong-Ho
    • Journal of Digital Contents Society
    • /
    • v.2 no.1
    • /
    • pp.73-79
    • /
    • 2001
  • Most of the existing algorithms try to disseminate the multimedia contents of internet service provider(ISP), without taking into account the needs and characteristics of specific websites including e-learning systems with web-based .educational contents. Sometimes the client must select the best one among the replicated repositories. However, this is a less reliable approach because clients' selections are made without prior information on server load capacity. In this paper we propose an agent system inspired by the need of improving QoS of delivering web-based educational multimedia contents without incurring long access delays. This agent system consists of three components, Analyzer, Knowledge Base, and Automaton embedded the capacity algorithm. It analyzes and investigates traffic information collected from individual replicated server by learners' requests, and selects a server which is available and is expected to provide the fastest latency time and the lowest loaded capacity, and achieves high performance by dynamic replicating web resources among multiple repositories.

  • PDF

An efficient privacy-preserving data sharing scheme in social network (소셜 네트워크에 적합한 효율적인 프라이버시 보호 데이터 공유 기법)

  • Jeon, Doo-Hyun;Chun, Ji-Young;Jeong, Ik-Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.447-461
    • /
    • 2012
  • A social network service(SNS) is gaining popularity as a new real-time information sharing mechanism. However, the user's privacy infringement is occurred frequently because the information that is shared through a social network include the private information such as user's identity or lifestyle patterns. To resolve this problem, the research about privacy preserving data sharing in social network are being proceed actively. In this paper, we proposed the efficient scheme for privacy preserving data sharing in social network. The proposed scheme provides an efficient conjunctive keyword search functionality. And, users who granted access right to storage server can store and search data in storage server. Also,, our scheme provide join/revocation functionality suited to the characteristics of a dynamic social network.

Path Finding with Maximum Speed Dynamic Heuristic (최고 속력 동적 휴리스틱을 이용한 경로탐색)

  • Kim, Ji-Soo;Lee, Ji-Wan;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1615-1622
    • /
    • 2009
  • Generally, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than The Center Based Navigation System(CBNS). TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement quality of a path, because of limited performance. In this paper, we propose a Dynamic Heuristic to improve quality of path in the TBNS. Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server. In this paper, we propose path-lading algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same size. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than A* algorithm.