Optimal State Allocation for Multicast Communications with Explicit Multicast Forwarding- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 4, - Java

Abstract—
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 ....etc

[:=Read Full Message Here=:]

Bank-aware Dynamic Cache bPartitioning for Multicore Architectures
A Seminar Report
by
Anoop S S
105102
Department of Computer Science & Engineering
College of Engineering Trivandrum
Kerala - 695016
2010-11


Abstract
As Chip-Multiprocessor systems (CMP) have become the predominant topology for lead-
ing microprocessors, critical components of the system are now integrated on a single chip.
This enables sharing of computation resources that was not previously possible. In addi ....etc

[:=Read Full Message Here=:]

SCAMP : SCAlable Multicast Protocol for Communication in Large Groups


This report proposes a new scalable multicast protocol for communication within a large group over Internet. There are many existing and new applications in which the groups involved are very large. An example would be Video-conferencing amongst a large and widely distributed group. The members of such a group can be spread across the entire Internet with no uniformity in their pattern of distribution. In such applications, there will be one or at most a few sources and ....etc

[:=Read Full Message Here=:]

Please, I am Gaisie Michael, a researcher residing in Ghana, in West Africa researching into the modern communication technologies.
I am aware of unicast, broadcast and multicast transmissions.

Please, may I know which one is the most adopted by communication industries, how it is implemented, its strengths and weaknesses and how it can be improved upon as the years go by.

I would be glad if it is presented in a report form or if follows a project procedure.

I am counting on your usual co-operation. Thank you. ....etc

[:=Read Full Message Here=:]

Content Based Multicast Model In Ad Hoc Network

Abstract :

In this model, the content of the multicast data determines the receiver set for the data and the receiver set changes dynamically as the content of the multicast changes. Delivering the multicast to intended receivers while minimizing the message overhead and reducing battery consumption is a challenge made harder because of node mobility. This novel multicast model that distributes this form of threat information in a message efficient manner. In this report, result from detai ....etc

[:=Read Full Message Here=:]

Network Congestion Control Algorithm for Tree Based reliable Multicast Protocols

ABSTRACT

A Congestion Control algorithm for Tree Based reliable Multicast Protocols is a collection of nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. Multicasting is to send single copy of a packet to all of those of clients that requested it, and not to send multiple copies of a packet over the same portion of the network, nor to send packets to ....etc

[:=Read Full Message Here=:]

MULTI USER SECURITY FOR MULTICAST COMMUNICATION

INTRODUCTION

The simplest computer chatting is a method of sending, receiving, and storing typed messages with a network of users. This network could be WAN (Wide Area Network) or LAN(Local Area Network). Our chatting system will deal only with LAN’s (static IP address) and it is made up of two applications one runs on the server side (any computer on the network you choose it to be the server) while the other is delivered and executed on the client PC. Every time ....etc

[:=Read Full Message Here=:]

I want a detailed report for the purpose of seminars.That means what is partition sheduler and adaptive partition shedeler ,its advantages,demerits,future scope. ....etc

[:=Read Full Message Here=:]

Pseudo-LRU based Cache Partitioning Algorithms
B.Tech Seminar report
by
Vipin V Johney
Department of Computer Science And Engineering
Government Engineering College, Thrissur
December 2010

report:


Contents
1 Introduction 1
1.1 Organization Of the Report . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Cache Partitioning Algorithm 3
2.1 Proling Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.2 Partitioning Logic . . . . . . . ....etc

[:=Read Full Message Here=:]

Secure Program Partitioning

Abstract
This paper presents secure program partitioning, a language-based technique for protecting con¯dential data during computation in distributed systems con- taining mutually untrusted hosts. Con¯dentiality and integrity policies can be expressed by annotat- ing programs with security types that constrain in- formation ow; these programs can then be parti- tioned automatically ....etc

[:=Read Full Message Here=:]