A proposed IP multicast hardware-routing algorithm using partitioned lookup table

Authors:
Mohsen M. Tantawy
Affiliations:
Network Planning Department, National Telecommunication Institute, Nasr City, Cairo, Egypt
Venue:
TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Year:
2008

Citing 2
Cited 2

A Parallel IP-Address Forwarding Approach Based on Partitioned Lookup Table Techniques

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Hardware-based IP routing using partitioned lookup table

IEEE/ACM Transactions on Networking (TON)

An implementation of designing media streaming system for live broadcast

WSEAS TRANSACTIONS on COMMUNICATIONS
Designing and constructing live streaming system for broadcast

AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In contrast to the one-to-one model of IP unicast, in which data packets are sent from a single source to a single recipient, IP multicast provides a method of efficient many-to-many communication. This concept is becoming increasingly important, both in the Internet and in private networks, for providing services such as multimedia content delivery. IP packet Forwarding based on Partitioned Look Up Table (IFPLUT) is an algorithm used to partition the Forwarding Table (FT) based on the egress port. IFPLUT focus only on a unicast routing (single-source, single-destination). We present in this works a modified IFPLUT hardware-based algorithm to support multicast routing. Moreover a hardware architecture design is proposed for the modified algorithm with a study to optimize the routing memory loss.