Parallel  And  Distributed system                         

                                                                            Back to Project List 
                                    Domain Description

verify in www.ieee.org

                                                                          

1. ENABLING PUBLIC AUDITABILITY AND DATA DYNAMICS FOR STORAGE SECURITY IN CLOUD
    COMPUTING.

                                                                                                    View Abstract

                                   The main objective of our project is Enabling public Auditability and Dynamic Data storage security in cloud computing. Cloud computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and database to the centralized large data centers, where the management of the data and services may not be fully trustworthy. Here we have considered the third party auditor on behalf of the cloud client which eliminates the involvement of the client directly to the server, checks whether the correct person, access the task if it is not a right person the alarm triggers. Extensive security and performance analysis show that the proposed schemes are highly efficient and provably secure.

System Requirement Specification:-
DOMAIN : Transactions on parallel and distributed systems
SOFTWARE : Operating System: windows xp, Platform: DOTNET ,
Database: SQL Server 2005, Protocol: TCP

HARDWARE : Processor: Pentium-IV, Speed: 2.2 GHZ, RAM: 2GB, HDD: 80 GB

2. Packet Delay Modeling of Truncated Multi-Process ARQ Protocols for Parallel 
    Communications

                                                                                                    View Abstract

                        This paper presents a packet transmission delay modeling for networks using multiple truncated stop-and-wait (SAW) retransmission processes. The packet transmission delay includes the packet queueing delay (PQD) and the packet reordering delay (PRD). While the first type of delay is commonly known for any SAWprocedure, the latter is only introduced when multiple SAW processes are considered for parallel communications. These processes work independently while sharing the same packet traffic. By modeling the queueing buffer as an M/G/1 model, an analytical formula for the average PQD is provided. In addition, we model the PRD as a first-order Markov chain defined by a transition probability matrix, and derive the average PRD. Analytical formulae are provided considering the general case where error probabilities are different from a transmission to another, such as in automatic repeat request (ARQ) with packet combining, and for arbitrary values of the number of multi-SAW processes and maximum number of ARQ retransmissions.

System Requirement Specification:-
DOMAIN     : NETWORKING
SOFTWARE : Operating System: windows xp, Platform: DOTNET
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ, RAM: 512 MB, HDD: 80 GB

3. Resequencing Analysis of Stop-and-Wait ARQ for Parallel Multichannel  
    Communications

                                                                                                    View Abstract

                                   In this paper, we consider a multichannel data communication system in which the stop-and-wait automatic-repeatrequest protocol for parallel channels with an in-sequence delivery guarantee (MSW-ARQ-inS) is used for error control.We evaluate the resequencing delay and the resequencing buffer occupancy, respectively. Under the assumption that all channels have the same transmission rate but possibly different time-invariant error rates, we derive the probability generating function of the resequencing buffer occupancy and the probability mass function of the resequencing delay. Then, by assuming the Gilbert�Elliott model for each channel, we extend our analysis to time-varying channels. Through examples, we compute the probability mass functions of the resequencing buffer occupancy and the resequencing delay for time-invariant channels. From numerical and simulation results, we analyze trends in the mean resequencing buffer occupancy and the mean resequencing delay as functions of system parameters. We expect that the modeling technique and analytical approach used in this paper can be applied to the performance evaluation of other ARQ protocols (e.g., the selective-repeat ARQ) over multiple time-varying channels.

System Requirement Specification:-
DOMAIN     : TRANSACTION ON NETWORKING
SOFTWARE : Operating System: Windows xp, Platform: DOTNET
HARDWARE : Processor: Pentium-IV,Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

4. A TRACE-DRIVEN APPROACH TO EVALUATE THE SCALABILITY OF P2P-BASED VIDEO-
        ON- DEMAND SERVICE (IEEE-2009)

                                                                                                   View Abstract

            Peer-to-peer (P2P) networks have been emerging as one of the most promising approaches to improve the calability of video-on-demand (VoD) service over Internet. Although a number of architectures and streaming protocols have been proposed in pastyears, there is few work to study the practical performance of P2P-based VoD service especially considering the real user behaviorwhich actually has significant impact on the system scalability. Therefore, in this paper, we first characterize the user behavior byanalyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com.Then, we examine the practical scalability of P2P-based VoD service through extensive trace-driven simulation under a general system framework. The results show that P2P networks scale well in providing VoD service under real user behavior by saving a considerable percentage of server bandwidth. Moreover, it is observed that adopting hard cache at client side achieves much better system scalability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insightful light on the understanding of practical scalability of P2P-based VoDservice and be helpful to future system design and optimization.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp Platform: JAVA/J2EE
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM:512 MB,HDD: 80 GB

5. HOW TO EFFECTIVE USE MULTIPLE CHANNELS IN WIRELESS MESH NETWORK
    (IEEE-2009)

                                                                                                   View Abstract

                Operating on a frequency band occupying several on-overlapping channels, IEEE 802.11 is now widely used in Wireless Mesh Networks (WMNs). Many multi-channel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlappingchannels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that wean switch between different channels freely. Although simulations show that great improvements on network throughput cane observed in both cases, two fundamental questions remain:(1) Can we really use multiple non-overlapping channels freely in wireless mesh networks? (2)
                  If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attemptto answer these questions. We find that in spite of interferencebetween both overlapping and non-overlapping channels, we canstill use multi-channel in mesh networks under crtain conditions, but with care. We also show that the channel switching costis actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms and those channel assignment algorithms selecting one channel for each packet is not really beneficial.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLELAND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp, Platform: JAVA/J2EE, Protocal: MAC
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB,HDD: 80 GB

6. DYNAMIC ROUTING WITH SECURITY CONSIDERATIONS   (IEEE-2009)

                                                                                                   View Abstract

             Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic
results and to show the capability of the proposed algorithm.

System Requirement Specification:-
DOMAIN     : TRANSACTIONSONPARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: Windows XP Platform: JAVA,DB:SQL Server
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB,HDD: 80 GB

7. NEXT GENERATION COMMUNICATION ARCHITECTURE FOR VOICE CONFERENCE IN NETWORK
    SYSTEMS (IEEE-2008)

                                                                                                   View Abstract

                  Multiparty voice over �ip (MVoIP)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 peer-to-peer MVoIP system called peer Talk. 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 MvoIP services delivery into two phases: mixing phases and distribution phase. The decoupled model allows us to explore the asymmetric property of MVoIP 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. Peer Talk 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 simulation testbed and a real intenet environment.Our initial implementation demonstrates the feasiblility of our approach and show promising results.peer Talk can outperform existing approaches such as P2P overlay multicast and coupled distributed processing for providing MvOIP Services.

System Requirement Specification:-
DOMAIN        : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp, Platform: JAVA, Tool: JMF,
                  Protocol:VOIP,SW: PNSClient
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB ,HDD: 80 GB

8. INTERACTION OF IPSS:DISTRIBUTED RESOURCE ALLOCATION AND REVENUE
     MAXIMIZATION (IEEE-2008)

                                                                                                   View Abstract

                 The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how the profitability can be increased while maintaining good service qualities as the network scales up. In this work, we seek to understand the fundamental issues on the "interplay" (or interaction) between ISPs at different tiers. Although the local ISPs (which we term peers) can communicate with each other by purchasing the connectivity from transit ISPs, there stands an opportunity for them to set up private peering relationships. Under this competitive framework, we explore the issues on 1) the impact of peering relationship; 2) resource distribution; 3) revenue maximization; and 4) condition for network upgrade. First, a generalized model is presented to characterize the behaviors of peers and the transit ISP, in which their economic interests are reflected. We study how a peer can distributive determine its optimal peering strategy. Furthermore, we show how a transit ISP is able to utilize the avaiable information to infer its optimal pricing strategy, under which a revenue maximization is achieved. Two distributed algorithms are proposed to help ISPs to provide a fair and efficient bandwidth allocation to peers, avoiding a resource monopolization of the market. Last, we investigate the above issues in a "many-peers region," that is, when we scale up the network. We provide insightful evidence to show that the ISPs can still gain profits as they upgrade the network infrastructures. Extensive simulations are carried out to support our theoretical claims.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp, Platform: JAVA,DB: MySQL
HARDWARE : Processor:Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB,HDD: 80 GB

                                                       
                                                                                                                           Back to Project List