No abstract

The

IP address lookup is an important design issue for the high performance Internet routers. The most important function of routers is to determine the output port of an incoming IP packet according to its destination address. In this papel; we propose a scalable and simple forwarding table structure for fast hardware-based IP address lookup which reduces memory requirements and memory access times. Proposed scheme requires maJcimum two memory access times in the worst case tojnish an IP address lookup.And it consumes about 0.6 N I.1MBytes memory for large routing tables with 16,000 N 43,000 routing prejixes when any compression method is not used.

For the eficient accommodation of exploding wireless users, much interest has been taken in the optimal design of multi-tier cellular overlays. Although many studies arepublished in the literature, little concern has been taken in their deployment over urban areas having spatially non-uniform trafic distributions. The careful consideration of a spatial traflc distribution must be accompanied in order to achive an appropriate cell deployment. In this papel; we present an algorithmic approach to jointly deploy macrocells and microcells over urban areas. The proposed approach employs a novel characterization urban spatial trajjic distribution. The proposed algorithm determines a cost-effective set of macrocells and microcells. Through event-driven simulations, we evaluate the performance of resulting cell deployments in rerms of the number of deployed cells, resource utilization, call blocking and dropping probabilities, etc.