RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

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

        An Approach to Scheduling Bursty Traffic

        Mahmoud Daneshvar Farzanegan,Hossein Saidi,Mehdi Mahdavi 한국전자통신연구원 2014 ETRI Journal Vol.36 No.1

        The scheduling scheme in packet switching networks isone of the most critical features that can affect theperformance of the network. Hence, many schedulingalgorithms have been suggested and some indices, such asfairness and latency, have been proposed for thecomparison of their performances. While the nature ofInternet traffic is bursty, traditional scheduling algorithmstry to smooth the traffic and serve the users based on thissmoothed traffic. As a result, the fairness index mainlyconsiders this smoothed traffic and the service rate as themain parameter to differentiate among different sessionsor flows. This work uses burstiness as a differentiatingfactor to evaluate scheduling algorithms proposed in theliterature. To achieve this goal, a new index that evaluatesthe performance of a scheduler with bursty traffic isintroduced. Additionally, this paper introduces a newscheduler that not only uses arrival rates but alsoconsiders burstiness parameters in its schedulingalgorithms.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼