The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To improve the shift quality of vehicle with clutch-to-clutch gear shifts, a nonlinear controller is designed for the clutch slip control during the shift inertia phase of an Automatic Transmission (AT). Backstepping technique is used to deduce the control algorithm. Model uncertainties including steady state errors and unmodelled dynamics are also considered as additive disturbance inputs and the...
Recently, the significantly increased IPv6 address length has posed a greater challenge on wire-speed router for IP lookup. As a result, even the most efficient IPv4 lookup scheme can not meet the demand in IPv6. In this paper, we make a thorough observation on the characteristic of IPv4/IPv6 routing table and propose a novel division technique for routing table, with which the traditional LPM (longest...
Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space and poses a great challenge to the routing table lookup algorithms. Today's efficient IPv4 routing table lookup schemes can hardly be competent for IPv6. In this paper, we propose a multi-stage IPv6 routing table lookup algorithm...
Trie is a data structure that is widely used in the algorithms for routing table lookup. Usually, the structure and characteristics of the routing table are first examined, and then the efficient and effective trie-based algorithms are designed to speed up the time-critical path of packet processing in routers. This paper, on the contrary, uses a binary trie to make observations on the backbone BGP...
A router needs to perform a longest prefix matching on address lookup while most of algorithms so far are shortest prefix first search scheme except for LPFST(longest prefix first search tree). In this paper, we propose another longest prefix first search scheme of overlapping hash trie (OHT) for IPv4 and IPv6, which resolves the common problem facing at all longest prefix first search schemes including...
The next generation Internet Protocol, IPv6, has attracted growing attention and has been deploying worldwide, especially in Europe, Asia, and North America. With 128-bit address, IPv6 provides an extremely large address space and poses a great challenge to the routing table lookup algorithms. The previous algorithms need reconsideration. An IPv6-specific longest prefix matching (LPM) scheme called...
Longest prefix matching (LPM) is a challenging subject because of the increasing routing table size, the increasing link speed, and the increasing Internet traffic with decreasing packet size. With the advent of IPv6, it requires reconsideration of the previous schemes particularly designed for IPv4. We introduce the first algorithm that we are aware of to employ divide-and-conquer method for IPv6...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.