Sciweavers

50 search results - page 7 / 10
» On the Aggregatability of Router Forwarding Tables
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Failure inferencing based fast rerouting for handling transient link and node failures
— With the emergence of Voice over IP and other real-time business applications, there is a growing demand for an IP network with high service availability. Unfortunately, in tod...
Zifei Zhong, Srihari Nelakuditi, Yinzhe Yu, Sanghw...
ICC
2000
IEEE
124views Communications» more  ICC 2000»
13 years 12 months ago
A Fast IP Routing Lookup Scheme
Abstract—A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address look...
Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan
PADS
2003
ACM
14 years 21 days ago
Enabling Large-Scale Multicast Simulation by Reducing Memory Requirements
The simulation of large–scale multicast networks often requires a significant amount of memory that can easily exceed the capacity of current computers, both because of the inh...
Donghua Xu, George F. Riley, Mostafa H. Ammar, Ric...
IFIP
2009
Springer
14 years 2 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger
MSN
2005
Springer
14 years 28 days ago
Dual Binding Update with Additional Care of Address in Network Mobility
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Dual Binding Update (DBU ). In general, the nested mobile network...
Kwang Chul Jeong, Tae-Jin Lee, Hyunseung Choo