Presentation 2000/2/17
Flow Aggregation using OSPF Link State DataBase in Label Switching Router
Hideaki IMAIZUMI, Ken-ichi NAGAMINE, Kazunori SUGIURA, Jun MURAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper performs a mechanism reducing the required number of labels by using the Link State information of OSPF protocol, and evaluates the required number of labels used in the LSR(Label Switching Router). In LSR network which contains N Edge LSRs, this mechanism keeps required number of labels N*(N-1). We evaluate the required number of labels using topology-driven / ingress-egress-router label mappping policy using OSPF information. The flow aggregation using OSPF information kept required number of labels 20 in LSR network which contains 5 Edge LSRs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Label Switch / OSPF / LSDB / Flow Aggregation
Paper # CS99-144,CQ99-67
Date of Issue

Conference Information
Committee CQ
Conference Date 2000/2/17(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Communication Quality (CQ)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Flow Aggregation using OSPF Link State DataBase in Label Switching Router
Sub Title (in English)
Keyword(1) Label Switch
Keyword(2) OSPF
Keyword(3) LSDB
Keyword(4) Flow Aggregation
1st Author's Name Hideaki IMAIZUMI
1st Author's Affiliation Keio University()
2nd Author's Name Ken-ichi NAGAMINE
2nd Author's Affiliation Toshiba
3rd Author's Name Kazunori SUGIURA
3rd Author's Affiliation Communication Research Lab.
4th Author's Name Jun MURAI
4th Author's Affiliation Keio University
Date 2000/2/17
Paper # CS99-144,CQ99-67
Volume (vol) vol.99
Number (no) 622
Page pp.pp.-
#Pages 6
Date of Issue