RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재후보

        Head-End-Network에서 Web-Caching을 사용한 VOD 서버

        김백현 ( Backhyun Kim ),황태준 ( Taejune Hwang ),김익수 ( Iksoo Kim ) 한국인터넷정보학회 2004 인터넷정보학회논문지 Vol.5 No.1

        본 논문은 멀티미디어 서버의 과도한 부하는 물론 네트워크 자원의 비효율적인 사용과 같은 문제점을 해결하기 위한 단말-네트워크(HNET) 내에 새로운 분산 웹-캐싱 전략에 대한 다루고 있다. 제안된 분산 웹-캐싱은 인근에 위치하는 단말-노드들에 분산 망을 구현하여 특정 단말-노드에 부하가 집중되지 않고, HNET의 분산 단말-노드들에 복사본이 존재하지 않는 장점을 갖고 있다. 제안된 웹-캐싱 기법은 각 단말 노드들이 동일한 비디오 서비스를 요청할 경우 HNET 내의 스위칭 에이젼트의 제어아래 서버로부터 비디오의 일부 스트림만을 분산 저장하며, 서비스의 제공은 클라이언트들이 분산 단말-노드에 교호적으로 접속하여 서비스 받도록 한다. 새로운 Web-caching 기법에 사용된 제거 알고리듬은 LFU, LRU와 단말간 지연을 줄이기 위해 비디오의 첫 번째 스트림을 마지막으로 제거하는 방식을 조합하여 시뮬레이션을 수행하였다. This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia server and inefficient use of network resources. The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests service are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos in order to reduce end-to-end delay.

      • KCI등재

        모바일 애드 혹 네트워크에서 셀 구조에 기반 한 이동성 모델

        김백현(Backhyun Kim),박경모(Kyeongmo Park) 한국정보기술학회 2017 한국정보기술학회논문지 Vol.15 No.2

        Mobile ad-hoc network is the self-configuring network that mobile nodes conduct the entire process to offer the requested service by themselves without any preinstalled communication device. The free movement of mobile node can cause the frequent change of the transmission route and QoS(Quality of Service). Therefore, there are many demands to a mobility model to effectively evaluate network performance. However, most mobility models have features such as directivity and centralization. This paper proposes a new mobility model based on the logically configured hexagonal cell structure for lower directivity and centralization. We perform comparison experiments in the view of the number of hops, the frequency of a route change as the function of the network area and node speed with existing mobility models: Random Walk, Random Waypoint, Random Direction. Form the experimental results, we prove that our mobility model has better performance substantially than other mobility models.

      • KCI등재

        모바일 Ad-hoc 네트워크상의 전송경로 기반 캐싱기법

        김백현(Backhyun Kim),박경모(Kyeongmo Park) 한국정보기술학회 2017 한국정보기술학회논문지 Vol.15 No.9

        Mobile Ad-hoc networks(MANETs) are the horizontal and autonomous networks consisting of nodes performing an equivalent role. The node acts as both host with computing capabilities and router for path management. Therefore, MANETs require a transmission scheme for efficient use of node energy. As caching technique provides services using items stored in the node’s own cache, it enables efficient use of transmission bandwidth and node energy. This paper proposes caching scheme using the selected proxy based on the transmission path. Since the proxy selection process is performed only for the transmission paths, not for the entire network, transmission traffic and node load can be reduced. The performance of the proposed caching scheme is evaluated by the cache hit ratio according to node density and request rate. Simulation results show that the delivery path-based caching scheme can improve network usage efficiency as node density increases.

      • KCI등재

        모바일 에드혹 네트워크에서 적극적 협업 캐싱 시스템

        김백현(Backhyun Kim),우요섭(Yoseop Woo),김익수(Iksoo Kim) 한국정보기술학회 2020 한국정보기술학회논문지 Vol.18 No.1

        An ad-hoc network is an autonomous network composed of only nodes without the support of communication infrastructure. This network can be a good communication alternative in many situations where the communication infrastructure is not supported. Increasing demand for multimedia content requires high-speed and high-capacity communication technologies. Multimedia services in mobile ad-hoc networks with limited energy and communication performance require efficient transmission techniques because they reduce the available time of the nodes. Cooperative caching is a scheme to distribute content files across multiple nodes in a network to form an effective file cache. In this paper, we propose an aggressive cooperative caching scheme for caching content files in the path node and neighbor nodes adjacent to them. Since the transmission path changes dynamically due to the movement of nodes, the nodes performing caching also change dynamically. From the simulation results, the proposed caching scheme reduces the number of transport channels to 36% and shows a cache hit ratio of 67%. Therefore, the aggressive cooperative scheme can be an alternative technique that enables efficient use of node energy and transmission channel in mobile ad-hoc network environment.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼