Nen-Fu Huang

Performance analysis of deflection routing in optical burst-switched networks

This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on just-enough-time (JET) signaling. Generally speaking, buffer requirement is not vital for JET-based optical burst switching (OBS). However, if deflection routing is enabled, optical buffers are necessary to solve the insufficient offset time problem. A variant of priority queuing model is proposed to approximate burst loss probability and the results show that the model provides an accurate estimation. We also evaluate the performance of deflection routing in Arpanet-2 topology. Simulation results indicate that deflection routing evidently brings significant blocking performance gain, especially with fewer wavelengths and under lighter load. In addition, we notice that excessive deflection will cause longer end-to-end delay and reduce the blocking performance. Therefore, it is necessary to control the maximum allowed deflection occurrences of a burst.

The strongly connecting problem on multihop packet radio networks

The problem of strongly connecting a multihop packet radio network by using a minimal total amount of transmission power is investigated. This problem is shown to be NP-complete. An approximation algorithm with the same computational complexity as that of finding a minimum spanning tree is given. It is also shown that the approximation algorithm can find a solution no greater than twice that of the optimal solution. Experimental results show that the approximation solution may be close to the optimal solution. >

A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers

One of the pertinent design issues for new generation IP routers is the route-lookup mechanism. For each incoming IP packet, the IP routing is required to perform a longest-prefix matching on the route lookup in order to determine the packets next hop. This study presents a fast unicast route-lookup mechanism that only needs tiny SRAM and can be implemented using a hardware pipeline. The forwarding table, based on the proposed scheme, is small enough to fit into a faster SRAM with low cost. For example, a large routing table with 40000 routing entries can be compacted into a forwarding table of 450-470 kbytes costing less than US

A novel all-optical transport network with time-shared wavelength channels

30. Most route lookups need only one memory access; no lookup needs more than three memory accesses. When implemented using a hardware pipeline, the proposed mechanism can achieve one routing lookup every memory access. With current 10-ns SRAMs, this mechanism furnishes approximately 100/spl times/10/sup 6/ routing lookups/s, which is much faster than any current commercially available routing-lookup scheme.

A fast string-matching algorithm for network processor-based intrusion detection system

High-speed and high-capacity transport networks are necessary for providing future broadband services and multimedia applications. Optical networks, such as wavelength-routed networks and optical switching networks, are the most popular solutions. However, the limited electronic switching capability constrains the scalability of the multihop wavelength routed networks, while the difficulty and complexity of implementing efficient optical buffers and optical contention resolution schemes constrains the development of optical switching networks. This paper proposes a new architecture for the optical transport networks based on time-wavelength-space routers (TWSRs). The TWSR is equipped without optical buffers and optical contention resolution devices. A connection is established by constructing a time-slot based lightpath (ts-lightpath) between source TWSR and destination TWSR. The paper also proposes a heuristic algorithm for the problem of establishing the set of efficient ts-lightpaths for a given set of connection requests. The effectiveness of the proposed network architecture with the heuristic algorithm is demonstrated by simulation.

Intelligent handoff for mobile wireless internet

Network intrusion detection systems (NIDSs) are one of the latest developments in security. The matching of packet strings against collected signatures dominates signature-based NIDS performance. Network processors are also one of the fastest growing segments of the semiconductor market, because they are designed to provide scalable and flexible solutions that can accommodate change quickly and economically. This work presents a fast string-matching algorithm (called FNP) over the network processor platform that conducts matching sets of patterns in parallel. This design also supports numerous practical features such as case-sensitive string matching, signature prioritization, and multiple-content signatures. This efficient multiple-pattern matching algorithm utilizes the hardware facilities provided by typical network processors instead of employing the external lookup co-processors. To verify the efficiency and practicability of the proposed algorithm, it was implemented on the Vitesse IQ2000 network processor platform. The searching patterns used in the present experiments are derived from the well-known Snort ruleset cited by most open-source and commercial NIDSs. This work shows that combining our string-matching methodology, hashing engine supported by most network processors, and characteristics of current Snort signatures frequently improves performance and reduces number of memory accesses compared to conventional string-matching algorithms. Another contribution of this work is to highlight that, besides total number of searching patterns, shortest pattern length is also a major influence on NIDS multipattern matching algorithm performance.

A fast IP routing lookup scheme for gigabit switching routers

This paper presents an intelligent mobility management scheme for Mobile Wireless InterNet – MWIN. MWIN is a wireless service networks wherein its core network consisting of Internet routers and its access network can be built from any Internet-capable radio network. Two major standards are currently available for MWIN, i.e., the mobile IP and wireless LAN. Mobile IP solves address mobility problem with the Internet protocol while wireless LAN provides a wireless Internet access in the local area. However, both schemes solve problems independently at different layers, thereby some additional problems occur, e.g., delayed handoff, packet loss, and inefficient routing. This paper identifies these new problems and performs analyses and some real measurements on the handoff within MWIN. Then, a new handoff architecture that extends the features of both mobile IP and wireless LAN handoff mechanism was proposed. This new architecture consists of mobile IP extensions and a modified wireless LAN handoff algorithm. The effect of this enhancement provides a linkage between different layers for preventing packet loss and reducing handoff latency. Finally, some optimization issues regarding network planning and routing are addressed.

An Effective Spanning Tree Algorithm for a Bridged LAN

One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix matching on the address lookup in order to determine the packets next hop. This paper presents a fast route lookup mechanism that only needs tiny SRAM and can be implemented in a pipelined skill in hardware. Based on the proposed scheme, the forwarding table is tiny enough to fit in SRAM with very low cost. For example, a large routing table with 40,000 routing entries can be compacted to a forwarding table of 450-470 Kbytes. In the worst case, the number of memory accesses for a lookup is three. When implemented in a pipeline skill in hardware, the proposed mechanism can achieve one routing lookup every memory access. With current 10 ns SRAM, this mechanism furnishes approximately 100 million routing lookups per second. This is much faster than any current commercially available routing lookup schemes.

A GPU-Based Multiple-Pattern Matching Algorithm for Network Intrusion Detection Systems

1 Network (BLAN) is an internetare interconnected by bridges. topology of a BLAN is to enpath is existed between we propose a new

Design of multi-field IPv6 packet classifiers using ternary CAMs

By the development of network applications, network security issues are getting more and more important. This paper proposes a multiple-pattern matching algorithm for the network intrusion detection systems based on the GPU (Graphics Processing Units). The highly parallelism of the GPU computation power is used to inspect the packet content in parallel. The performance of the proposed approach is analyzed through evaluations such as using various texture formats and different implementations. Experimental results indicate that the performance of the proposed approach is twice of that of the modified Wu-Manber algorithm used in Snort. The proposed approach makes a commodity and cheap GPU card as a high performance pattern matching co-processor.