Abstract: The invention discloses to a method to synchronize and synthesize bus transaction traces for an un-timed virtual environment. The steps are the followings providing a simulation environment and an emulation environment; recording the transaction of intellectual property (IP) through the bus, collecting the plurality of continuously transferred transaction set, connecting a plurality of transaction blocks recorded from the simulation environment, and assigning a corresponding number to the transaction block; labeling a begin time mark and a transfer time mark; initializing a plurality of parameters; taking a transaction block; judging the type of the transaction block respectively; and after respectively assuring that the transaction block is the last transaction block in the simulated transaction block series, output these parameter values.

Abstract: A method and system for packet classification is proposed for applications such as firewalls, intrusion detection, policy-based routing, and network service differentiations, within network systems such as Internet or intranet/extranet systems. The proposed method and system is characterized by the use of protocol-oriented rule rearrangement, the probable bit vector (PBV) based on the aggregated bit vectors (ABV) and folded bit vectors (FBV), an ABV-FBV index table dataset whose data structure is based on a featured split full-tree schema, and a DCBV (Don't-Care Bit Vector) dataset for packet classification. The combination of these features allows the packet classification to be implemented with a reduced amount of memory and access time during operation.

Abstract: A method and system for packet classification is proposed for applications such as firewalls, intrusion detection, policy-based routing, and network service differentiations, within network systems such as Internet or intranet/extranet systems. The proposed method and system is characterized by the use of protocol-oriented rule rearrangement, the probable bit vector (PBV) based on the aggregated bit vectors (ABV) and folded bit vectors (FBV), an ABV-FBV index table dataset whose data structure is based on a featured split full-tree schema, and a DCBV (Don't-Care Bit Vector) dataset for packet classification. The combination of these features allows the packet classification to be implemented with a reduced amount of memory and access time during operation.