• Title/Summary/Keyword: 버퍼 관리 정책

Search Result 46, Processing Time 0.02 seconds

A Study on the Improvement Plan and Issue of Network Neutrality Regulations (망 중립성 규제의 쟁점과 개선방안에 관한 연구)

  • Jin, Ho-Un;Shin, Jin-Sik;Choi, Seong-Jhin
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.2
    • /
    • pp.71-78
    • /
    • 2017
  • A network neutrality is the concept that ISP assures users non-discrimination, interconnection, accessibility for ensuring users without control or interference of equal services in the network. But today a network traffic is growing rapidly in sensitive buffering services as P2P service diffusion and mass video stream service. To manage this problem, ISP violates a net neutrality by control, change and interfere with service. And then the debate about net neutrality is happening. Therefore in this paper, we compare and analyze net neutrality principles, concepts, and legislative policy in the native and foreign. Based on this, we suggested the issues and improvement plan of net neutrality guard line.

A Node Management Scheduling for Efficient Guarantee of QOS based on Overlay Multicast Environment (오버레이 멀티캐스트 환경에서 효율적인 QOS의 보장을 위한 노드관리 스케줄링)

  • Choi, Sung-Uk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1614-1620
    • /
    • 2009
  • The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

Optimizing LRU Lock Management in the Linux Kernel for Improving Parallel Write Throughout in Many-Core CPU Systems (매니코어 CPU 시스템의 병렬 쓰기 성능 향상을 위한 리눅스 커널의 LRU 관리 최적화 기법)

  • Eun-Kyu Byun;Gibeom Gu;Kwang-Jin Oh;Jiwoo Bang
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.7
    • /
    • pp.209-216
    • /
    • 2023
  • Modern HPC systems are equipped with many-core CPUs with dozens of cores. When performing parallel I/O in such a system, there is a limit to scalability due to the problem of the LRU lock management policy of the Linux system. The study proposes an improved FinerLRU to solve this problem. Our new FinerLRU improves the parallel write performance of file systems using the buffer cache through granular lock management by increasing the number of LRU locks upto the maximum number of cores. The proposed method was implemented in Linux 5.18.11, and the performance was measured on two types of CPUs, Intel Icelake Xeon and Intel Knights landing, with different characteristics, and it was found that a performance improvement of about two times can be obtained in both types of systems.

A novel page replacement policy associated with ACT-R inspired by human memory retrieval process (인간 기억 인출 과정을 응용하여 설계된 ACT-R 기반 페이지 교체 정책)

  • Roh, Hong-Chan;Park, Sang-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.18D no.1
    • /
    • pp.1-8
    • /
    • 2011
  • The cache structure, which is designed for assuring fast accesses to frequently accessed data, resides on the various levels of computer system hierarchies. Many studies on this cache structure have been conducted and thus many page-replacement algorithms have been proposed. Most of page-replacement algorithms are designed on the basis of heuristic methods by using their own criteria such as how recently pages are accessed and how often they are accessed. This data-retrieval process in computer systems is analogous to human memory retrieval process since the retrieval process of human memory depends on frequency and recency of the retrieval events as well. A recent study regarding human memory cognition revealed that the possibility of the retrieval success and the retrieval latency have a strong correlation with the frequency and recency of the previous retrieval events. In this paper, we propose a novel page-replacement algorithm by utilizing the knowledge from the recent research regarding human memory cognition. Through a set of experiments, we demonstrated that our new method presents better hit-ratio than the LRFU algorithm which has been known as the best performing page-replacement algorithm for DBMS caches.

Cooperative Video Streaming and Active Node Buffer Management Technique in Hybrid CDN/P2P Architecture

  • Lee, Jun Pyo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.11
    • /
    • pp.11-19
    • /
    • 2019
  • Recently, hybrid CDN/P2P video streaming architecture is specially designed and deployed to achieve the scalability of P2P networks and the desired low delay and high throughput of CDNs. In this paper, we propose a cooperative video streaming and active node buffer management technique in hybrid CDN/P2P architecture. The key idea of this streaming strategy is to minimize network latency such as jitter and packet loss and to maximize the QoS(quality of service) by effectively and efficiently utilizing the information sharing of file location in CDN's proxy server which is an end node located close to a user and P2P network. Through simulation, we show that the proposed cooperative video streaming and active node buffer management technique based on CDN and P2P network improves the performance of realtime video streaming compared to previous methods.

An Adaptive Delay Control based on the Transmission Urgency of the Packets in the Wireless Networks (무선망에서 패킷의 전송 긴급성을 고려한 적응적 지연 제어 방안)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1A
    • /
    • pp.44-53
    • /
    • 2010
  • This paper proposes a traffic management policy for delay control in the wireless networks. The so-called EDD(Earliest Due Date) scheme is adopted as the packet scheduling policy, so that the service provision is performed in the order of the transmission urgency of the backlogged packets. In addition, we derive a formula to determine the contention window, one of the MAC parameters, with the goal of minimizing the non-work conserving characteristics of the traditional MAC scheme. This method eliminates the burden of the class-wise parameter settings which is typically required for the priority control. Simulations are performed to show the validity of the proposed scheme in comparison with the policy that adopts the class-level queue management such as the IEEE 802.11e standard. Smaller delays and higher rates of delay guarantees are observed throughout the experiments.