메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
In this paper. we investigate the problem of management and control in wide area networks. Especially we focus on QoS guaranteed routing, the important function of network management. QoS guaranteed routing in a large network comes to be intractable because data management and routing computation usually becomes a formidable task. Moreover. in general. an wide area network consists of heterogeneous sub-domains. In this paper. we propose the hierarchical routing scheme that enables QoS routing between heterogeneous domains and reduces routing time even in a large network.
The proposing routing scheme is the one using routing service of Network Control Center(NCC) and domain based routing approach so as to resolve the problems caused by resource information management in every node in previous studies. The network consists of several individually controlled domains, which are interconnected by gateway links. Each domain is controlled by its own NCC, and NCCs are organized hierarchically. Each NCC maintains routing information for its own intra-domain routing, and has a portion of the information required for inter-domain routing. To accomplish domain-level inter-domain routing, the information of more than one NCC is merged. Also, we present the way of mapping a complex multi-domain topology graph into a simplified graph and solving inter-domain routing problem seamless as intra-domain routing. The proposed hierarchical routing scheme makes it possible to manage large network, and makes routing problem simple by dividing the problem into small parts so that each pan solved easily.

목차

Abstract

Ⅰ. Introduction

Ⅱ. Network Model and Definitions

Ⅲ. Routing Subject to QoS

Ⅳ. Information Update Strategy

Ⅴ. Conclusions

References

저자소개

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2009-569-017769361