RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      KCI등재 SCIE SCOPUS

      Joint Optimization of Time-Slot Allocation and Traffic Steering for Large-Scale Deterministic Networks

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      Recently, time-sensitive services have expanded from traditional industrial control systems to more scenarios. Some time-sensitive applications, such as remote surgery, autonomous driving, Augmented Reality (AR), etc., require deterministic end-to-end...

      Recently, time-sensitive services have expanded from traditional industrial control systems to more scenarios. Some time-sensitive applications, such as remote surgery, autonomous driving, Augmented Reality (AR), etc., require deterministic end-to-end delay and jitter in data transmission. Deterministic Network (DetNet) is proposed as a promising technology for providing deterministic service in Wide Area Networks (WAN). DetNet guarantees deterministic end-to-end delay and jitter by specifying a certain routing path and transmission time-slots for time-sensitive flows. However, how to efficiently steer time-sensitive flows while jointly allocating transmission time-slots is still an open problem. Existing flow scheduling algorithms are limited in the scenarios of Local Area Networks (LAN), and do not consider the impact of propagation delay in large-scale networks. To this end, we study the joint optimization of time-slot allocation and traffic steering, while considering the propagation delay of WAN links. Our objective is to maximize the number of successfully deployed time-sensitive flows under the constraints of required end-to-end delay. Accordingly, we formulate the studied problem as an Integer Linear Programming (ILP) model. Since it is proved to be an NP-hard problem, we design a heuristic algorithm named Genetic-based Deterministic Network Traffic Scheduling (GDNTS). The solution with the largest number of deployed time-sensitive flows can be obtained from the evolution of chromosomes in GDNTS. Compared with the benchmark algorithms, extensive simulation results show that GDNTS improves the deployed time sensitive flows number by 22.85% in average.

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

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

      나만을 위한 추천자료

      해외이동버튼