Presentation 1998/5/15
A Routing Mechanism based on the Flow
Kenjiro Komaki, Mario Tokoro,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this research, we notice that (destination address, source address, destination port number, source port number) identifies flow uniquely, so we suggest routing mechanism froute, which can route every flow individually. In various way to accomplish froute, we choose expanding routing table and utilize Radix Tree mechanism which is used in existing routing table. With the special feature of Radix Tree mechanism which is the support for variable length address and non-consecutive netmask, we accomplish the routing mechanism which can be treated transparently with existing mechanism. Futhermore, we compare froute with existing mechanism and related works, then prove froute is useful.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) routing mechanism / routing table / flow / Radix Tree / binary search
Paper #
Date of Issue

Conference Information
Committee IN
Conference Date 1998/5/15(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 Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Routing Mechanism based on the Flow
Sub Title (in English)
Keyword(1) routing mechanism
Keyword(2) routing table
Keyword(3) flow
Keyword(4) Radix Tree
Keyword(5) binary search
1st Author's Name Kenjiro Komaki
1st Author's Affiliation Department of Computer Science, Faculty of Science and Technology, Keio University()
2nd Author's Name Mario Tokoro
2nd Author's Affiliation Keio University
Date 1998/5/15
Paper #
Volume (vol) vol.98
Number (no) 50
Page pp.pp.-
#Pages 8
Date of Issue