RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      A Packet Scheduling for Input-Queued Router with Deadline Constraints

      한글로보기

      https://www.riss.kr/link?id=E805223

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      This paper considers a scheduling problem of routers with VOQ(Virtual Output Queue)s, where the router has an N × N port input-queued switch and each input queue is composed of N VOQs. The objective of the paper is to develope scheduling algorithms which minimize mean tardiness under a common due date. The paper characterizes the optimal solution properties. Based upon the characterization, a integer programming is formulated for the optimal solution and two optimal solution algorithms are developed for two special cases of 2 × 2 switch and N × N switch with identical traffic.
      번역하기

      This paper considers a scheduling problem of routers with VOQ(Virtual Output Queue)s, where the router has an N × N port input-queued switch and each input queue is composed of N VOQs. The objective of the paper is to develope scheduling algorithms w...

      This paper considers a scheduling problem of routers with VOQ(Virtual Output Queue)s, where the router has an N × N port input-queued switch and each input queue is composed of N VOQs. The objective of the paper is to develope scheduling algorithms which minimize mean tardiness under a common due date. The paper characterizes the optimal solution properties. Based upon the characterization, a integer programming is formulated for the optimal solution and two optimal solution algorithms are developed for two special cases of 2 × 2 switch and N × N switch with identical traffic.

      더보기

      목차 (Table of Contents)

      • 1. Introduction
      • 2. Problem Description and Analysis
      • 3. Solution Algorithms
      • 3.1 Mathematical Formulation for the Optimal Solution
      • 3.2 Special cases
      • 1. Introduction
      • 2. Problem Description and Analysis
      • 3. Solution Algorithms
      • 3.1 Mathematical Formulation for the Optimal Solution
      • 3.2 Special cases
      • 4. Conclusions
      • References
      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼