公开(公告)号：JP2000151691A

公开(公告)日：2000-05-30

申请号：JP30415999

申请日：1999-10-26

Applicant: CSELT CENTRO STUDI LAB TELECOM

Inventor： FILIPPI ENRICA ,  INNOCENTI VIVIANA

IPC: H04L12/701 ,  H04L12/741 ,  H04L12/933 ,  H04L12/935 ,  H04L12/56

Abstract: PROBLEM TO BE SOLVED: To provide a memory structure that ensures incremental update of a routing table and optimum utilizing of a physical memory. SOLUTION: A memory to retrieve information by a prefix analysis in order to build up a routing table for a node of a high speed communication network such as the Internet especially includes a memory element M1 that stores one set of information items and each of the information items relates to mask information and target information denoting a number of important characters in respective prefixes. In order to realize a retrieval reference based on coincidence of a longest prefix, each cell includes an information field to provide an address of a succeeding line for consecutive retrieval or an arrived target and a couple of flags specifying contents of the information field. An auxiliary vector AUX includes cells of the same number as memory lines and when a flag in a cell of the memory element indicates necessity for retrieval of a succeeding line and read of the target, the target information is stored in a cell relating to the succeeding line.

公开(公告)号：CA2287041C

公开(公告)日：2003-12-30

申请号：CA2287041

申请日：1999-10-21

Applicant: CSELT CENTRO STUDI LAB TELECOM

Inventor： INNOCENTI VIVIANA ,  FILIPPI ENRICA

IPC: H04L45/74 ,  H04L49/111 ,  G11C15/00 ,  H04L29/02 ,  H04L12/56

Abstract: A memory for searching information through prefix analysis, in particular f or building routing tables for nodes of high speed communication networks, such as Internet network, comprises a memory element (M1) which stores a set of information items associated each one to a mask information indicative of the number of significant characters in the respective prefix and to a target information. For the implementation of a search criterion based on the longest prefix match, each cell comprises an information field that provides either an address of a next row for the continuation of a search or an information relating to a target reached, and a pair of flags (GO, TARGET) specifying the contents of the information field. An auxiliary vecto r (AUX), which comprises as many cells as many the memory rows are, is arranged to store, when the flags in a cell in the memory element indicate the reaching of a target together with the need of prosecuting search operations in a next row, the target information in its cell associated to said next row. (Fig. 1).

公开(公告)号：IT1305140B1

公开(公告)日：2001-04-10

申请号：ITTO980909

申请日：1998-10-27

Applicant: CSELT CENTRO STUDI LAB TELECOM

Inventor： FILIPPI ENRICA ,  INNOCENTI VIVIANA

IPC: H04L45/74 ,  H04L49/111

Abstract: A memory for searching information through prefix analysis, in particular for building routing tables for nodes of high speed communication networks, such as Internet network, comprises a memory element (M1) which stores a set of information items associated each one to a mask information indicative of the number of significant characters in the respective prefix and to a target information. For the implementation of a search criterion based on the longest prefix match, each cell comprises an information field that provides either an address of a next row for the continuation of a search or an information relating to a target reached, and a pair of flags (GO, TARGET) specifying the contents of the information field. An auxiliary vector (AUX), which comprises as many cells as many the memory rows are, is arranged to store, when the flags in a cell in the memory element indicate the reaching of a target together with the need of prosecuting search operations in a next row, the target information in its cell associated to said next row.

公开(公告)号：CA2287041A1

公开(公告)日：2000-04-27

申请号：CA2287041

申请日：1999-10-21

Applicant: CSELT CENTRO STUDI LAB TELECOM

Inventor： INNOCENTI VIVIANA ,  FILIPPI ENRICA

IPC: H04L45/74 ,  H04L49/111 ,  G11C15/00 ,  H04L29/02 ,  H04L12/56

Abstract: A memory for searching information through prefix analysis, in particular for building routing tables for nodes of high speed communication networks, such as Internet network, comprises a memory element (M1 ) which stores a set of information items associated each one to a mask information indicative of the number of significant characters in the respective prefix and to a target information. For the implementation of a search criterion based on the longest prefix match, each cell comprises an information field that provides either an address of a next row for the continuation of a search or an information relating to a target reached, and a pair of flags (GO, TARGET) specifying the contents of the information field. An auxiliary vector (AUX), which comprises as many cells as many the memory rows are, is arranged to store, when the flags in a cell in the memory element indicate the reaching of a target together with the need of prosecuting search operations in a next row, the target information in its cell associated to said next row. (Fig. 1).