큐잉 이론을 이용한 DBSW 알고리즘 성능 분석
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 c...
        Saved in:
      
    
          | Published in | 한국콘텐츠학회 논문지, 6(11) Vol. 6; no. 11; pp. 276 - 284 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | Korean | 
| Published | 
            한국콘텐츠학회
    
        2006
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1598-4877 2508-6723  | 
Cover
| Abstract | 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. WRR 기법은 대역을 보장해야 하는 스케줄링 기법으로 개발되었다. 최근에는 무선 통신 네트워크에서 다양한 대역이나 지연과 같은 차등화 된 서비스들을 제공 할 수 있도록 각 큐에 다른 가중치를 지정함으로써 여러 큐들을 직접적으로 관리할 수 있도록 하였다. 또한, WRR 알고리즘은 DBSW 구조에 의해 효율적으로 구현할 수 있다. 본 논문은 WRR 구현의 대표적인 방법인 DBSW 구조의 수학적 분석을 수행하고 분석결과와 시뮬레이션 결과를 비교 분석한다. 분석 데이터와 시뮬레이션 데이터는 수학적 분석이 타당하게 전개되었음을 입증하는 성능 결과를 보여주고 있다. | 
    
|---|---|
| AbstractList | WRR 기법은 대역을 보장해야 하는 스케쥴링 기법으로 개발되었다. 최근에는 무선 통신 네트워크에서 다양한 대역이나 지연과 같은 차등화 된 서비스들을 제공 할 수 있도록 각 큐에 다른 가중치를 지정함으로써 여러 큐들을 직접적으로 관리할 수 있도록 하였다. 또한, WRR 알고리즘은 DBSW 구조에 의해 효율적으로 구현할 수 있다.본 논문은 WRR 구현의 대표적인 방법인 DBSW 구조의 수학적 분석을 수행하고 분석결과와 시뮬레이션 결과를 비교 분석한다. 분석 데이터와 시뮬레이션 데이터는 수학적 분석이 타당하게 전개되었음을 입증하는 성능 결과를 보여주고 있다. 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. KCI Citation Count: 0 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. WRR 기법은 대역을 보장해야 하는 스케줄링 기법으로 개발되었다. 최근에는 무선 통신 네트워크에서 다양한 대역이나 지연과 같은 차등화 된 서비스들을 제공 할 수 있도록 각 큐에 다른 가중치를 지정함으로써 여러 큐들을 직접적으로 관리할 수 있도록 하였다. 또한, WRR 알고리즘은 DBSW 구조에 의해 효율적으로 구현할 수 있다. 본 논문은 WRR 구현의 대표적인 방법인 DBSW 구조의 수학적 분석을 수행하고 분석결과와 시뮬레이션 결과를 비교 분석한다. 분석 데이터와 시뮬레이션 데이터는 수학적 분석이 타당하게 전개되었음을 입증하는 성능 결과를 보여주고 있다.  | 
    
| Author | 조해성(Hae-Seong Cho) | 
    
| Author_xml | – sequence: 1 fullname: 조해성(Hae-Seong Cho)  | 
    
| BackLink | https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001173403$$DAccess content in National Research Foundation of Korea (NRF) | 
    
| BookMark | eNo9jL1Kw1AYQC9SwVr7DlkEl8CX-x-32latFgtacbzE5EZCaiqJDh2FLIqDS0HESh0sCC6i-FDm9h2sVpzOGQ5nGZWSfqIXUBkzkDYXmJRQ2WGutKkUYglVsyw6BmAEuMNxGa1PL2_N45VlRh_F09iM8h8z9y_T4YPV2Dg4sszw5ut9XExezeTOMvlbcf1sFZ-5yUcraDH0epmu_rGCDjeb3fq23e5steq1th07DuO272kAnwqBmQQImOcA90GAlkw6mEufBpxgLUI_BK1dIanmAachJkAJ1y6poLX5N0lDFfuR6nvRL0_6Kk5Vbb_bUi7hlJFZujpP4yg7j1QSZD21U9vtYAAOlGPCHBfP8N8lF2l0qoPIU2cz8dKB2us0mgBCCkw5-QbCuWzD | 
    
| ContentType | Journal Article | 
    
| DBID | DBRKI TDB JDI ACYCR  | 
    
| DEWEY | 005.7 | 
    
| DatabaseName | DBPIA - 디비피아 누리미디어 DBpia [Open Access] KoreaScience Korean Citation Index  | 
    
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Computer Science | 
    
| DocumentTitleAlternate | DBSW Algorithm Performance Criteria Using Queueing Theory | 
    
| DocumentTitle_FL | DBSW Algorithm Performance Criteria Using Queueing Theory | 
    
| EISSN | 2508-6723 | 
    
| EndPage | 284 | 
    
| ExternalDocumentID | oai_kci_go_kr_ARTI_936453 JAKO200604623519262 NODE00787246  | 
    
| GroupedDBID | .UV ALMA_UNASSIGNED_HOLDINGS DBRKI TDB JDI ACYCR M~E  | 
    
| ID | FETCH-LOGICAL-k1156-cae00c47725800d5a106c070e8581268c4d632e7fcf0ee9784e6d64f230436e93 | 
    
| ISSN | 1598-4877 | 
    
| IngestDate | Tue Nov 21 21:11:34 EST 2023 Fri Dec 22 12:02:19 EST 2023 Thu Feb 06 13:27:30 EST 2025  | 
    
| IsOpenAccess | true | 
    
| IsPeerReviewed | false | 
    
| IsScholarly | false | 
    
| Issue | 11 | 
    
| Keywords | 수학적분석 Scheduling 스케쥴링 DBSW WRR Mathematical Analysis  | 
    
| Language | Korean | 
    
| LinkModel | OpenURL | 
    
| MergedId | FETCHMERGED-LOGICAL-k1156-cae00c47725800d5a106c070e8581268c4d632e7fcf0ee9784e6d64f230436e93 | 
    
| Notes | KISTI1.1003/JNL.JAKO200604623519262 G704-001475.2006.6.11.012  | 
    
| OpenAccessLink | http://click.ndsl.kr/servlet/LinkingDetailView?cn=JAKO200604623519262&dbt=JAKO&org_code=O481&site_code=SS1481&service_code=01 | 
    
| PageCount | 9 | 
    
| ParticipantIDs | nrf_kci_oai_kci_go_kr_ARTI_936453 kisti_ndsl_JAKO200604623519262 nurimedia_primary_NODE00787246  | 
    
| PublicationCentury | 2000 | 
    
| PublicationDate | 2006 | 
    
| PublicationDateYYYYMMDD | 2006-01-01 | 
    
| PublicationDate_xml | – year: 2006 text: 2006  | 
    
| PublicationDecade | 2000 | 
    
| PublicationTitle | 한국콘텐츠학회 논문지, 6(11) | 
    
| PublicationTitleAlternate | The Journal of the Korea Contents Association | 
    
| PublicationYear | 2006 | 
    
| Publisher | 한국콘텐츠학회 | 
    
| Publisher_xml | – name: 한국콘텐츠학회 | 
    
| SSID | ssib005306162 ssib036279156 ssib001107260 ssib053377518 ssib030194663 ssib044738273  | 
    
| Score | 1.3641931 | 
    
| Snippet | WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly... WRR 기법은 대역을 보장해야 하는 스케쥴링 기법으로 개발되었다. 최근에는 무선 통신 네트워크에서 다양한 대역이나 지연과 같은 차등화 된 서비스들을 제공 할 수...  | 
    
| SourceID | nrf kisti nurimedia  | 
    
| SourceType | Open Website Open Access Repository Publisher  | 
    
| StartPage | 276 | 
    
| SubjectTerms | 학제간연구 | 
    
| Title | 큐잉 이론을 이용한 DBSW 알고리즘 성능 분석 | 
    
| URI | https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00787246 http://click.ndsl.kr/servlet/LinkingDetailView?cn=JAKO200604623519262&dbt=JAKO&org_code=O481&site_code=SS1481&service_code=01 https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001173403  | 
    
| Volume | 6 | 
    
| hasFullText | 1 | 
    
| inHoldings | 1 | 
    
| isFullTextHit | |
| isPrint | |
| ispartofPNX | 한국콘텐츠학회 논문지, 2006, 6(11), , pp.276-284 | 
    
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2508-6723 dateEnd: 99991231 omitProxy: true ssIdentifier: ssib044738273 issn: 1598-4877 databaseCode: M~E dateStart: 20060101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre  | 
    
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Ni9NAFB_KXvQiiorrxxLBOUkkH5P58Ja0kbqyu4fdxb2FNJnqUmmlthcPgtCL4sHLgoiV9eCC4EUU_xX_B5v9H3xv0qZBBL-gpI83Ly8zecOb35vJvCHkmvSzDIb51OadPLVZKjJbdiWzZZpynWueK7N6vrHJ27tsfS_YazS-1b5aGo86N7LHv9xX8i9WBR7YFXfJ_oVlK6XAABrsC1ewMFz_yMY0bgESpMqhcZOqmEqI8JFq0YjROKKhS0NnzpGsXgZESEOFClRAFfidaPtuKRBQ2aRxSCPf3AxaOA2bWASEkkZIMhq5WCZBS3AdqYgjtyxTrTrmrR5itAY0bKFYBExpGhDMGxBJ88BSuKxaaOoSoUxkiNCIYV0EldVKi2G4NFrcHbFlJT3ZTrW9rfFMpeb9wWLmo5roqDrlf1az7t0Vzp7Oz43RhgcQUNpclJueF0MCr_d8t-7fBa9BBa883e6nhN2bW60YkZfwGKaCBwSIkwIbT-IlTIWY26uFpQHEbe4ybSP4XMz6X_lNwBhCucucR4wJX9ZgJyB2gatnJjXwvIUQa2EAsg-QqT8EpHWiP8bjIsDn1ODTzmlyah73WGHZic-QRm9wltw8fvqyePvMKqZfZu8Oi-kEqeL1h-ODNxZ2SKs4ePH98-Hs6GNx9MoqJp9mz99bs6-TYjI9R3ZvxTvNtj0_zMPuQdDB7SzVjpMxCOYCiFHyIHUdnsF4o2UAGJPLjOXc97ToZl1HayUkA0fBWRcXLXyulX-erPQHfX2BWF7gdVSmuVAZZ6ILiJPjr-OJQDGdO6tkzbQ96eePHiTr4Z0t7E64CxtPo_S4t0quwktJetl-gtnV8f_eIOkNE4ghbycKV-Z9UFK9suRhmfklqZv24u8ELpGTy_m6y2RlNBzrK4BgR5010x1-ACJAdWA | 
    
| linkProvider | ISSN International Centre | 
    
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%ED%81%90%EC%9E%89+%EC%9D%B4%EB%A1%A0%EC%9D%84+%EC%9D%B4%EC%9A%A9%ED%95%9C+DBSW+%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98+%EC%84%B1%EB%8A%A5+%EB%B6%84%EC%84%9D&rft.jtitle=%ED%95%9C%EA%B5%AD%EC%BD%98%ED%85%90%EC%B8%A0%ED%95%99%ED%9A%8C%EB%85%BC%EB%AC%B8%EC%A7%80&rft.au=%EC%A1%B0%ED%95%B4%EC%84%B1%28Hae-Seong+Cho%29&rft.date=2006&rft.pub=%ED%95%9C%EA%B5%AD%EC%BD%98%ED%85%90%EC%B8%A0%ED%95%99%ED%9A%8C&rft.issn=1598-4877&rft.eissn=2508-6723&rft.volume=6&rft.issue=11&rft.spage=276&rft.epage=284&rft.externalDocID=NODE00787246 | 
    
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1598-4877&client=summon | 
    
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1598-4877&client=summon | 
    
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1598-4877&client=summon |