IJSRST162229 | Received: 26 March 2016 | Accepted: 30 March 2016 | March-April 2016 [(2)2: 52-55] © 2016 IJSRST | Volume 2 | Issue 2 | Print ISSN: 2395-6011 | Online ISSN: 2395-602X Themed Section: Technical - Review 52 Throughput-Delay Analysis for Multicast with Inter Session Network Coding A. Aiswaryalakshmi, K. P. Megartha, L. Muthulakshmi, S. Siva Kumar Department of Information Technology, Dhanalakshmi College of Engineering, Chennai, Tamiladu, India ABSTRACT Here, we characterize the throughput of a broad cast network with receivers using rate less codes with block size. We characterize the system throughput asymptotically. Specifically, we explicitly show how the throughput behaves for different values of the coding block size as a function. We are able to provide a lower bound on the maximum achievable throughput. Using simulations, we show the tightness of the bound with respect to system parameters and find that its performance is significantly better than the previously known lower bounds. The packets are not decidable if any deviation is occurred. Keywords: Broadcast, network coding, rateless codes, throughput analysis. I. INTRODUCTION Broadcast erasure channel (BEC) channels between the transmitter and the receivers are modeled as packet erasure channels where transmitted packets may either be erased or successfully received. This model describes a situation where packets may get lost or are not decodable at the receiver due to a variety of factors such as channel fading, interference, or checksum errors. Instead of transmitting the broadcast data packet one after another through feedback and retransmissions, we investigate a class of coding schemes called rateless codes,[2] Fountain codes are erasure coding schemes which are rateless, in the sense that they adapt to erasure channels with unknown parameters [3]. II. METHODS AND MATERIAL Experimental Study Here we have a centralized server and multiple users, user need to get registered, each of them will be provided a unique key. The key that is generated will be unique and complex so that it will not be accessible by any of the users. So files cannot be easily exposable. Any one user will be considered as a main user among them, others will have to get recourses from the main user, with the help of that unique key. Everything will get completed in a synchronous manner, if any deviations occurred, it will be overseen by the user, which will be transparent to the admin. If there is a mismatch in keys the data or content will get automatically erased. It will have response time and throughput. All the requests from the users will queued in coding blocks, called rateless code. The broadcast with discrete queuing model will show the process flow of how the queuing takes place in the coding blocks. Figure 1. Broadcast with Discrete-Time Queuing Model.