인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
개인구독
소속 기관이 없으신 경우, 개인 정기구독을 하시면 저렴하게
논문을 무제한 열람 이용할 수 있어요.
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 저자정보
초록·키워드
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.
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.
본문·목차
인공지능 문자 인식 모델을 통해 추출된 텍스트로, 일부 오타나 오류가 포함될 수 있으나 지속적으로 개선 중입니다.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
오류를 발견하셨다면 해당 부분을 드래그한 후 ' 를 통해 신고해주세요.
최근 본 자료 전체보기
UCI(KEPA) : I410-ECN-0101-2009-569-017769361
