BRAINRICH TECHNOLOGY
Our Brain for Ur Success….
FINAL YEAR STUDENT PROJECTS IEEE Project Titles
IEEE Papers – 2009, 2008, 2007 and so on
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: A large number of peer-to-peer streaming systems have been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multipath and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this paper, we present an analytical study that considers the relationship between delay and loss for general overlays: we study the trade-off between the playback delay and the probability of missing a packet and we derive bounds on the scalability of the systems. We present an exact model of pushbased overlays and show that the bounds hold under diverse conditions: in the presence of errors, under node churn, and when using forward error correction and various retransmission schemes.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: We study multicast in a noncooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, through appropriate cost allocation and other economic measures, with replicable and encodable properties of information flows considered. We show that known cost allocation schemes are not sufficient. We provide a shadow-pricebased cost allocation for networks without capacity limits and show that it enforces minimum-cost multicast. This improves previous result where a 2-approximate multicast flow is enforced. For capacitated networks, computing cost allocation by ignoring edge capacities will not yield correct results. We show that an edge tax scheme can be combined with a cost allocation to strictly enforce optimal multicast flows in this more realistic case. If taxes are not desirable, they can be returned to flows while maintaining weak enforcement of the optimal flow. We relate the taxes to VCG payment schemes and discuss an efficient primal-dual algorithm that simultaneously computes the taxes, the cost allocation, and the optimal multicast flow, with potential of fully distributed implementations.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Firewalls are the mainstay of enterprise security and the most widely adopted technology for protecting private networks. An error in a firewall policy either creates security holes that will allow malicious traffic to sneak into a private network or blocks legitimate traffic and disrupts normal business processes, which in turn could lead to irreparable, if not tragic, consequences. It has been observed that most firewall policies on the Internet are poorly designed and have many errors. Therefore, how to design firewall policies correctly is an important issue. In this paper, we propose the method of diverse firewall design, which consists of three phases: a design phase, a comparison phase, and a resolution phase. In the design phase, the same requirement specification of a firewall policy is given to multiple teams who proceed independently to design different versions of the firewall policy. In the comparison phase, the resulting multiple versions are compared with each other to detect all functional discrepancies between them. In the resolution phase, all discrepancies are resolved and a firewall that is agreed upon by all teams is generated.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: BitTorrent has emerged as a very popular peer-to-peer file sharing system, which uses an embedded set of incentive mechanisms to encourage contribution and prevent free-riding. However, BitTorrent's ability to prevent free-riding needs further study. In this paper, we present a fluid model with two different classes of peers to capture the effect of free-riding on BitTorrent-like systems. With the model, we find that BitTorrent's incentive mechanism is successful in preventing free-riding in a system without seeds but may not succeed in producing a disincentive for free-riding in a system with a high number of seeds. The reason for this is that BitTorrent does not employ any effective mechanisms for seeds to effectively guard against free-riding. Therefore, we propose a seed bandwidth allocation strategy for the BitTorrent system to reduce the effect of seeds on free-riding. Finally, simulation results are given that validate what we have found in our analysis and demonstrate the effectiveness of the proposed strategy.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose computation complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree-based schemes, this scheme provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Multiparty voice-over-IP (MVolP) services allow a group of people to freely communicate with each other via the Internet, which have many important applications such as online gaming and teleconferencing. In this paper, we present a peer-to-peer MVolP system called peerTalk. Compared to traditional approaches such as server-based mixing, peerTalk achieves better scalability and failure resilience by dynamically distributing the stream processing workload among different peers. Particularly, peerTalk decouples the MVolP service delivery into two phases: mixing phase and distribution phase. The decoupled model allows us to explore the asymmetric property of MVolP services (for example, distinct speaking/listening activities and unequal inbound/outbound bandwidths) so that the system can better adapt to distinct stream mixing and distribution requirements. To overcome arbitrary peer departures/ failures, peerTalk provides lightweight backup schemes to achieve fast failure recovery. We have implemented a prototype of the peerTalk system and evaluated its performance using both a large-scale simulation testbed and a real Internet environment. Our initial implementation demonstrates the feasibility of our approach and shows promising results: peerTalk can
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
outperform existing approaches such as P2P overlay multicast and coupled distributed processing for providing MVolP services.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Threshold-multisignature schemes combine the properties of threshold group-oriented signature schemes and multisignature schemes to yield a signature scheme that allows a threshold (t) or more group members to collaboratively sign an arbitrary message. In contrast to threshold group signatures, the individual signers do not remain anonymous, but are publicly identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient thresholdmultisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: We study multicast in a non cooperative environment where information flows selfishly route themselves through the cheapest paths available. The main challenge is to enforce such selfish multicast flows to stabilize at a socially optimal operating point incurring minimum total edge cost, through appropriate cost allocation and other economic measures, with replicable and encodable properties of information flows considered. We show that known cost allocation schemes are not sufficient. We provide a shadow-pricebased cost allocation for networks without capacity limits and show that it enforces minimum-cost multicast. This improves previous result where a 2-approximate multicast flow is enforced. For capacitated networks, computing cost allocation by ignoring edge capacities will not yield correct results. We show that an edge tax scheme can be combined with a cost allocation to strictly enforce optimal multicast flows in this more realistic case. If taxes are not desirable, they can be returned to flows while maintaining weak enforcement of the optimal flow. We relate the taxes toVCGpayment schemes and discuss an efficient primal-dual algorithm that simultaneously computes the taxes, the cost allocation, and the optimal multicast flow, with potential of fully distributed implementations.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semideterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semideterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then, we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN Hierarchical Routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Recent years have witnessed a growing interest in applications of wireless sensor and actor networks (WSANs). In these applications, a set of mobile actor nodes are deployed in addition to sensors in order to collect sensors’ data and perform specific tasks in response to detected events/objects. In most scenarios, actors have to respond collectively, which requires interactor coordination. Therefore, maintaining a connected interactor network is critical to the effectiveness of WSANs. However, WSANs often operate unattended in harsh environments where actors can easily fail or get damaged. An actor failure may lead to partitioning the interactor network and thus hinder the fulfillment of the application requirements. In this paper, we present DARA, a Distributed Actor Recovery Algorithm, which opts to efficiently restore the connectivity of the interactor network that has been affected by the failure of an actor. Two variants of the algorithm are developed to address 1- and 2-connectivity requirements. The idea is to identify the least set of actors that should be repositioned in order to reestablish a particular level of connectivity. DARA strives to localize the scope of the recovery process and minimize the movement overhead imposed on the involved actors. The effectiveness of DARA is validated through simulation experiments.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: The problem of sharing the cost of multicast transmissions was studied in the past, and two mechanisms, Marginal Cost (MC) and Shapley Value (SH), were proposed to solve it. Although both of them are strategyproof mechanisms, the distributed protocols implementing them are susceptible to manipulation by autonomous nodes. We propose a distributed Shapley Value mechanism in which the participating nodes do not have incentives to deviate from the mechanism specifications. We show that the proposed mechanism is a faithful implementation of the Shapley Value mechanism. We experimentally investigate the performance of the existing and the proposed cost-sharing mechanisms by implementing and deploying them on PlanetLab. We compare the execution time of MC and SH mechanisms for the Tamper-Proof and Autonomous Node models. We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. We show that the MC mechanisms generate a smaller revenue compared to the SH mechanisms, and thus, they are not attractive to the content provider. We also show that increasing the number of users per node is beneficial for the systems implementing the SH mechanisms from both computational and economic perspectives.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite the presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com
Abstract: In this paper, we consider the problem of detecting whether a compromised router is maliciously manipulating its stream of packets. In particular, we are concerned with a simple yet effective attack in which a router selectively drops packets destined for some victim. Unfortunately, it is quite challenging to attribute a missing packet to a malicious action because normal network congestion can produce the same effect. Modern networks routinely drop packets when the load temporarily exceeds their buffering capacities. Previous detection protocols have tried to address this problem with a userdefined threshold: too many dropped packets imply malicious intent. However, this heuristic is fundamentally unsound; setting this threshold is, at best, an art and will certainly create unnecessary false positives or mask highly focused attacks. We have designed, developed, and implemented a compromised router detection protocol that dynamically infers, based on measured traffic rates and buffer sizes, the number of congestive packet losses that will occur. Once the ambiguity from congestion is removed, subsequent packet losses can be attributed to malicious actions. We have tested our protocol in Emulab and have studied its effectiveness in differentiating attacks from legitimate network behavior.
6/1, 1st Floor, Gokulae Street, Ramnagar, Coimbatore- 641 009. Phone : 0422- 4377414 Mobile : 9894604623 Mail: info@brainrichtech.com Web: www.brainrichtech.com