• Title/Summary/Keyword: DBSW

Search Result 3, Processing Time 0.019 seconds

DBSW Algorithm Performance Criteria Using Queueing Theory (큐잉 이론을 이용한 DBSW 알고리즘 성능 분석)

  • Cho, Hae-Seong
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.11
    • /
    • pp.276-284
    • /
    • 2006
  • WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.

  • PDF

Performance Analysis of Binary Scheduling Wheel Structure based on Weighted Round Robin (가중치 원형 분배 기반 이진 스케쥴링 바퀴구조의 성능 분석)

  • Cho, Hae-Seong;Lee, Sang-Tae;Chon, Byoung-Sil
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.631-640
    • /
    • 2001
  • Round robin scheduling discipline, which is a sort of frame-based scheduling, is quite simple and straightforward for handling multiple queues, and by putting a different weight on each queue, a network can offer differentiated services such as different bandwidth, or delay bound. The most typical algorithm among this disciplines is the weighted round robin(WRR). Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the DBSW structure decreases average buffer length because it is capable of maintaining the allocated weight of each VC correctly.

  • PDF

Dictionary Based Software Watermarking Technique (사전 소프트웨어 워터마크 기술 기반)

  • Pervez, Zeeshan;Lee, Sungyoung;Lee, Young-Koo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.241-242
    • /
    • 2009
  • As software is becoming increasing important to the human society, so does the effort to produce them is also increasing.. All of these efforts can be at risk when source code of the application is reverse engineered by the software pirate. Many attempts have been made to protect Intellectual Property Rights (IPR); one of the newest attempts to protect IPR is software watermarking. It is used to prove ownership right when IPR are violated, and also prevents the bandit from altering the code for his own use. In this paper we are presenting a new technique for software watermarking know as Dictionary Based Software Watermarking (DBSW). DBSW works by embedding dummy instructions in source code with the help of predefined mapping already available in the dictionary. These instructions are identical to the normal instructions of the program and are hard to identify or to extract from the watermarked program. With the help of DBSW we not only can stop source code alteration but can also identify the buyer how has distributed the pirated copy.