EA200000328A1 - METHOD AND SYSTEM FOR QUICK ROUTING SEARCHES - Google Patents

METHOD AND SYSTEM FOR QUICK ROUTING SEARCHES

Info

Publication number
EA200000328A1
EA200000328A1 EA200000328A EA200000328A EA200000328A1 EA 200000328 A1 EA200000328 A1 EA 200000328A1 EA 200000328 A EA200000328 A EA 200000328A EA 200000328 A EA200000328 A EA 200000328A EA 200000328 A1 EA200000328 A1 EA 200000328A1
Authority
EA
Eurasian Patent Office
Prior art keywords
array
representation
stored
routing
next transfer
Prior art date
Application number
EA200000328A
Other languages
Russian (ru)
Inventor
Андрей Бродник
Микаель Дегермарк
Сванте Карлссон
Стефен Пинк
Original Assignee
Эффнет Груп Аб
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from SE9703332A external-priority patent/SE9703332D0/en
Application filed by Эффнет Груп Аб filed Critical Эффнет Груп Аб
Priority claimed from PCT/SE1998/000854 external-priority patent/WO1999014906A1/en
Publication of EA200000328A1 publication Critical patent/EA200000328A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

Abstract

В способе поиска IP маршрутизации в таблице маршрутизации, содержащей элементы из префиксов произвольной длины с соответствующей информацией о следующей пересылке в таблице следующей пересылки, для определения, куда должны быть направлены IP дейтаграммы, запоминается представление таблицы маршрутизации в виде полного префиксного дерева (7), определенного префиксами всех элементов таблицы маршрутизации. Далее, запоминаются представление двоичного вектора (8), содержащего данные среза по префиксному дереву (7) на текущей глубине (D), и массив указателей, содержащих индексы для таблицы следующей пересылки и для фрагмента следующего уровня. Упомянутый двоичный вектор (8) разделяется на битовые маски, и представление битовых масок запоминается в карте-таблице. Затем запоминаются массив кодовых слов, каждое из которых кодирует индекс строки в карте-таблице и смещение указателя, и массив базовых адресов. И, наконец, осуществляется поиск.Международная заявка была опубликована вместе с отчетом о международном поиске.In the method of searching for IP routing in a routing table containing elements from prefixes of arbitrary length with relevant information about the next transfer in the next transfer table, to determine where the IP datagram should be sent, the representation of the routing table is stored as a complete prefix tree (7) defined prefixes of all elements of the routing table. Further, the representation of the binary vector (8) containing the slice data on the prefix tree (7) at the current depth (D), and an array of pointers containing indices for the next transfer table and for the next level fragment are remembered. The said binary vector (8) is divided into bit masks, and the representation of the bit masks is stored in the map table. Then, an array of code words is stored, each of which encodes the index of a string in a map table and a pointer offset, and an array of base addresses. Finally, a search is carried out. The international application was published along with an international search report.

EA200000328A 1997-09-15 1998-05-11 METHOD AND SYSTEM FOR QUICK ROUTING SEARCHES EA200000328A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9703332A SE9703332D0 (en) 1997-05-09 1997-09-15 Method and system for fast routing lookups
PCT/SE1998/000854 WO1999014906A1 (en) 1997-09-15 1998-05-11 Method and system for fast routing lookups

Publications (1)

Publication Number Publication Date
EA200000328A1 true EA200000328A1 (en) 2000-10-30

Family

ID=20408258

Family Applications (1)

Application Number Title Priority Date Filing Date
EA200000328A EA200000328A1 (en) 1997-09-15 1998-05-11 METHOD AND SYSTEM FOR QUICK ROUTING SEARCHES

Country Status (7)

Country Link
JP (1) JP2001517024A (en)
KR (1) KR20010030607A (en)
CA (1) CA2303118A1 (en)
EA (1) EA200000328A1 (en)
ID (1) ID24241A (en)
IL (1) IL134835A0 (en)
SK (1) SK3692000A3 (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3570323B2 (en) * 1999-05-11 2004-09-29 日本電気株式会社 How to store prefixes for addresses
US20010042130A1 (en) * 1999-12-10 2001-11-15 Mosaid Technologies, Inc. Method and apparatus for depth expansion of a longest prefix match lookup table
KR100364433B1 (en) * 2000-04-28 2002-12-11 학교법인 동국학원 IP address look-up method using a bit-vector table
US7966421B2 (en) 2000-06-21 2011-06-21 SAtech Group, A.B. Limited Liability Company Method and apparatus for logically expanding the length of a search key
KR100493099B1 (en) * 2000-12-22 2005-06-02 삼성전자주식회사 Route lookup and routing/forwarding table management for high-speed internet protocol router
KR100378599B1 (en) * 2001-04-02 2003-04-03 한국전자통신연구원 Routing Table Lookup Using Indirected RAM Indexing
KR20020067469A (en) * 2002-07-25 2002-08-22 크로스반도체기술 주식회사 System and method for destination address look-up of IP packet
EP3687123B1 (en) * 2013-01-29 2022-07-27 Huawei Technologies Co., Ltd. Packet processing method and forwarding element
JP6016215B2 (en) 2013-12-20 2016-10-26 インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ Method, apparatus, and computer program for performing merge sorting of records having a trie tree structure with high efficiency
JP5960863B1 (en) * 2015-03-11 2016-08-02 エヌ・ティ・ティ・コミュニケーションズ株式会社 SEARCH DEVICE, SEARCH METHOD, PROGRAM, AND RECORDING MEDIUM
JP6205463B2 (en) * 2016-06-23 2017-09-27 エヌ・ティ・ティ・コミュニケーションズ株式会社 SEARCH DEVICE, SEARCH METHOD, PROGRAM, AND RECORDING MEDIUM

Also Published As

Publication number Publication date
SK3692000A3 (en) 2000-09-12
CA2303118A1 (en) 1999-03-25
IL134835A0 (en) 2001-05-20
JP2001517024A (en) 2001-10-02
KR20010030607A (en) 2001-04-16
ID24241A (en) 2000-07-13

Similar Documents

Publication Publication Date Title
DE69912410D1 (en) FAST STRING SEARCHING AND INDICATING
CA2434876A1 (en) Method and apparatus for ternary content addressable memory (tcam) table management
US6578048B1 (en) Method for constructing a catalog of the files on a network and a catalog so constructed
CA2393760C (en) Method and apparatus for longest match address lookup
EA200000328A1 (en) METHOD AND SYSTEM FOR QUICK ROUTING SEARCHES
BR9912015A (en) Search engine for retrieving information, process for retrieving information in a search engine, and using a search engine
BG104202A (en) Method and system for quick search for route selection
EP0268373A3 (en) Method and apparatus for determining a data base address
ATE325488T1 (en) CUSTOMIZING THE LONGEST PREFIX USING TREE-LIKE ßBITMAP DATA STRUCTURES
DE69927109D1 (en) Information search cache through prefix analysis for high-speed network nodes
GB0025042D0 (en) Method of and apparatus for retrieving data representing a postal address from a database of postal addresses
EP0250705A3 (en) Method and apparatus for retrieval of symbol strings from data
KR100586461B1 (en) Method, Hardware Architecture and Recording Medium for Searching IP Address by Using Pipeline Binary Tree
WO2004030305A2 (en) Improved dense mode coding scheme
FR2047949B1 (en)
NO20004629L (en) Database suitable for configuring and / or optimizing a system, as well as methods for generating the database
KR960019064A (en) Automatic performance device
CN102867049A (en) Chinese PINYIN quick word segmentation method based on word search tree
Huo et al. A practical implementation of compressed suffix arrays with applications to self-indexing
SE9704767D0 (en) Management in data structures
Navarro et al. New space/time tradeoffs for top-k document retrieval on sequences
CN112256821A (en) Method, device, equipment and storage medium for complementing Chinese address
KR20050066807A (en) Apparatus and method for packet classification in router
Preparata et al. Dynamic planar point location with optimal query time
SE9903460L (en) Method and system for fast routing lookups