This Blog Provide Topics, Abstracts, Documentations, Slides for various Seminars, Projects, Paper Presentations. After Reading Abstract You Can Download Corresponding Paper By Clicking The Link Given At The Bottom. On The Right Side Bar Select Your Branches CSE, ECE, EEE, IT, MCA, MBA, Civil, Mechanical Departments And More Stuff Will Be Added From Time To Time. So Please Be In Touch With This Blog For More And Apt Information.
|Speech Compression| |Data Security| |Artificial Neural Networks| |Moletronics| |AI Speech Recognition| |ATM| |Blue Eyes| |Brain Computer Interface| |Fuzzy Logic| |Mobile Voting| |Information Security Using Steganography| |Modern Irrigation Systems| |Asynchronous Chip| |Smartphone| |Gizmag|Subtractive Synthesis | Spread Spectrum | Speech Compression | Paper Batteries | Satellite Encryption | Robotics 1 2 | Silicon in Nanotechnology | Renewable Energy Systems | Reed Solomon Code | Vlsi Paper Presentation | Green Nanotechnology | Aerospace Nanotechnology | Nanotechnology | Brain Controlled Car 1 | Bubble Power | Brain Machine Interface | Beam Robotics Nervous Systems | Artificial Photosynthesis | Neural Networks | Adaptive Filtering | Finger Print Recognizer | Vlsi Chip | Digital Water Marking |
Optimal State Allocation for Multicast Communications with Explicit Multicast Forwarding
In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on Explicit Multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Compared with previous work, our mechanism needs fewer routers in a multicast tree to store forwarding states and therefore leads to a more balanced distribution of forwarding states among routers. We focus on two problems and formulate each of them as an optimization problem. The first problem, referred to as MINSTATE, minimizes the total number of routers that store forwarding states in a multicast tree. The second problem, referred to as BALANCESTATE, minimizes the maximum number of forwarding states stored in a router for all multicast groups, which is proved to be an NP-hard problem. We design a distributed algorithm that obtains the optimal solution to the first problem and propose an approximation algorithm for the second problem. We also prove that the approach adopted by most existing works to allocate forwarding states in the branching routers of a multicast tree is a special case of our mechanism. The simulation results show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance forwarding states stored among routers and reduce the number of routers that store the forwarding states for a multicast tree
Existing System:-
• This system is not scalable in terms of both the number of members in a multicast group and the number of multicast groups in the network.
• This system is unable the answer the questions like
MINSTATE.
BALANCESTATE.
Proposed System:-
• Multicast forward mechanisms are used to achieve scalability in both the number of members in a multicast group and the number of multicast groups in the network.
• Here we used distribution algorithm to achieve
MINSTATE.
BALANCESTATE.
Hardware Interface:-
• Hard disk : 40 GB
• RAM : 512 MB
• Processor Speed : 2.20GHz
• Processor : Pentium IV Processor
Software Interface:-
• JDK 1.5
• Swing Builder