To see the other types of publications on this topic, follow the link: Reliable multicast transport protocol.
Dissertations / Theses on the topic 'Reliable multicast transport protocol'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 45 dissertations / theses for your research on the topic 'Reliable multicast transport protocol.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Barcellos, Antonio Marinho Pilla. "PRMP : a scaleable polling-based reliable multicast protocol." Thesis, University of Newcastle Upon Tyne, 1998. http://hdl.handle.net/10443/1981.
Full textAbstract:
Traditional reliable unicast protocols (e.g., TCP), known as sender-initiated schemes, do not scale well for one-to-many reliable multicast due mainly to implosion losses caused by excessive rate of feedback packets arriving from receivers. So, recent multicast protocols have been devised following the receiver- initiated approach: scalability (in terms of control traffic, protocol state and end-systems processing requirements) is achieved by making the sender independent from receivers; the sender does not know the membership of the destination group. However, this comes with a cost: the lack of knowledge about and control of receivers at the sender has negative implications with respect to throughput, network cost (bandwidth required), and degree of reliability offered to applications. This thesis follows an alternative approach: instead of adopting the receiver-initiated scheme, it greatly enhances the scalability of the sender-initiated scheme, by means of polling-based feedback and hierarchy. The resulting protocol is named PRMP: polling-based Reliable Multicast protocol. Its unique implosion avoidance mechanism polls receivers at carefully planned timing instants achieving a low and uniformly distributed rate of feedback packets. The sender retains controls of receivers: the main PRMP mechanisms are based on a one-to-many sliding window mechanism, which efficiently and elegantly extends the abstraction from reliable unicasting to reliable multicasting. The error control mechanism of PRMP incorporates the use of NACKs and selective, cumulative acknowledgment of packets; additionally, it can wait and judiciously decide between multicast and selective unicast retransmissions. The flow control mechanism prevents unnecessary losses caused by the overrunning of receivers, despite variations in round-trip times and application speeds. The scalability provided by the polling mechanism is further extended by an hierarchic organization to exploit distributed processing and local recovery: receivers are organized according to a tree-structure. However, unlike other tree-based protocols, PRMP is "fully-hierarchic": each parent node forwards data via multicast to its children, and retains/explores the control of and knowledge about its children while autonomously applying error, flow, congestion and session controls in the communication with them. Two congestion control mechanisms, one window-based and another rate-based, have been incorporated to PRMP. As shown through simulation experiments, the resulting protocol q,chieves high though put with cost- effective reliable multicasting. They also show the scalability and effectiveness of PRMP mechanisms. PRMP can achieve reliable multicast with the same kind of reliability guarantees provided by TCP but without incurring prohibitive costs in terms of network cost or recovery latency found in other protocols.
2
Johnstone, George S. Williams Glenn D. "Applied reliable multicast using the Xpress Transport Protocol (XTP) /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1997. http://handle.dtic.mil/100.2/ADA331754.
Full textAbstract:
Thesis (M.S. in Information Technology Management) Naval Postgraduate School, March 1997.<br>Thesis advisors, W. Timothy Strayer and Rex Buddenberg. Includes bibliographical references (p. 111-114). Also available online.
3
Johnstone, George S., and Glenn D. Williams. "Applied reliable multicast using the Xpress Transport Protocol (XTP)." Thesis, Monterey, California. Naval Postgraduate School, 1997. http://hdl.handle.net/10945/31933.
Full textAbstract:
Reliable multicast protocols provide a means to deliver data from one sender to many receivers with assurance. Reliable multicast is better suited than unicast for the bandwidth restricted, high error rate, hostile communications environment found in the military's tactical arena. General purpose protocols ensure adaptability to the variety of communications suites currently used by the military. As well, any acceptable multicast protocol must support varying levels of assurance, from unreliable delivery to full reliability. This thesis evaluates the performance capabilities of one implementation of the Xpress Transport Protocol SandiaXTP, which is a reliable multicast transport protocol. Four experiments are run on a testbed consisting of four Sun SPARC4 workstations. These experiments look at unicast and multicast transmissions with varying numbers of induced efforts. The included performance measurements examine the various challenges present in a communications medium subject to attack. The results demonstrate that reliable multicast in a tactical environment is possible.
4
Klos, Lawrence. "Reliable Multicast in Mobile Ad Hoc Wireless Networks." ScholarWorks@UNO, 2009. http://scholarworks.uno.edu/td/1101.
Full textAbstract:
A mobile wireless ad hoc network (MANET) consists of a group of mobile nodes communicating wirelessly with no fixed infrastructure. Each node acts as source or receiver, and all play a role in path discovery and packet routing. MANETs are growing in popularity due to multiple usage models, ease of deployment and recent advances in hardware with which to implement them. MANETs are a natural environment for multicasting, or group communication, where one source transmits data packets through the network to multiple receivers. Proposed applications for MANET group communication ranges from personal network apps, impromptu small scale business meetings and gatherings, to conference, academic or sports complex presentations for large crowds reflect the wide range of conditions such a protocol must handle. Other applications such as covert military operations, search and rescue, disaster recovery and emergency response operations reflect the "mission critical" nature of many ad hoc applications. Reliable data delivery is important for all categories, but vital for this last one. It is a feature that a MANET group communication protocol must provide. Routing protocols for MANETs are challenged with establishing and maintaining data routes through the network in the face of mobility, bandwidth constraints and power limitations. Multicast communication presents additional challenges to protocols. In this dissertation we study reliability in multicast MANET routing protocols. Several on-demand multicast protocols are discussed and their performance compared. Then a new reliability protocol, R-ODMRP is presented that runs on top of ODMRP, a well documented "best effort" protocol with high reliability. This protocol is evaluated against ODMRP in a standard network simulator, ns-2. Next, reliable multicast MANET protocols are discussed and compared. We then present a second new protocol, Reyes, also a reliable on-demand multicast communication protocol. Reyes is implemented in the ns-2 simulator and compared against the current standards for reliability, flooding and ODMRP. R-ODMRP is used as a comparison point as well. Performance results are comprehensively described for latency, bandwidth and reliable data delivery. The simulations show Reyes to greatly outperform the other protocols in terms of reliability, while also outperforming R-ODMRP in terms of latency and bandwidth overhead.
5
Daldoul, Yousri. "Transport Multicast fiable de la vidéo sur le réseau WiFi." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00919403.
Full textAbstract:
Le transport multicast est une solution efficace pour envoyer le même contenu à plusieurs récepteurs en même temps. Ce mode est principalement utilisé pour fournir des flux multimédia en temps réel. Cependant, le multicast classique de l'IEEE 802.11 n'utilise aucun mécanisme d'acquittement. Ainsi, l'échec de réception implique la perte définitive du paquet. Cela limite la fiabilité du transport multicast et impact la qualité des applications vidéo. Pour résoudre ce problème, 802.11v et 802.11aa sont définis récemment. Le premier amendement propose Direct Multicast Service (DMS). D'autre part, le 802.11aa introduit GroupCast with Retries (GCR). GCR définit deux nouvelles politiques de retransmission : Block Ack (BACK) et Unsolicited Retry (UR).Dans cette thèse, nous évaluons et comparons les performances de 802.11v/aa. Nos résultats montrent que tous les nouveaux protocoles multicast génèrent un overhead de transmission important. En outre, DMS a une scalabilité très limitée, et GCR-BACK n'est pas approprié pour des grands groupes multicast. D'autre part, nous montrons que DMS et GCR-BACK génèrent des latences de transmission importantes lorsque le nombre de récepteurs augmente. Par ailleurs, nous étudions les facteurs de pertes dans les réseaux sans fil. Nous montrons que l'indisponibilité du récepteur peut être la cause principale des pertes importantes et de leur nature en rafales. En particulier, nos résultats montrent que la surcharge du processeur peut provoquer un taux de perte de 100%, et que le pourcentage de livraison peut être limité à 35% lorsque la carte 802.11 est en mode d'économie d'énergie.Pour éviter les collisions et améliorer la fiabilité du transport multicast, nous définissons le mécanisme Busy Symbol (BS). Nos résultats montrent que BS évite les collisions et assure un taux de succès de transmission très important. Afin d'améliorer davantage la fiabilité du trafic multicast, nous définissons un nouveau protocole multicast, appelé Block Negative Acknowledgement (BNAK). Ce protocole opère comme suit. L'AP envoi un bloc de paquets suivi par un Block NAK Request (BNR). Le BNR permet aux membres de détecter les données manquantes et d'envoyer une demande de retransmission, c.à.d. un Block NAK Response (BNAK). Un BNAK est transmis en utilisant la procédure classique d'accès au canal afin d'éviter toute collision avec d'autres paquets. En plus, cette demande est acquittée. Sous l'hypothèse que 1) le récepteur est situé dans la zone de couverture du débit de transmission utilisé, 2) les collisions sont évitées et 3) le terminal a la bonne configuration, très peu de demandes de retransmission sont envoyées, et la bande passante est préservée. Nos résultats montrent que BNAK a une très grande scalabilité et génère des délais très limités. En outre, nous définissons un algorithme d'adaptation de débit pour BNAK. Nous montrons que le bon débit de transmission est sélectionné moyennant un overhead très réduit de moins de 1%. En plus, la conception de notre protocole supporte la diffusion scalable de lavvidéo. Cette caractéristique vise à résoudre la problématique de la fluctuation de la bande passante, et à prendre en considération l'hétérogénéité des récepteurs dans un réseau sans fil.
6
Jonsson, Fredrik. "Arm-P : Almost Reliable Multicast protocol." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-14954.
Full textAbstract:
<p>Distribution of information across IP based networks is today part of our everyday life. IP is the backbone of the Internet and most office networks. We use IP to access web pages, listen to radio, and to create computation clusters. All these examples use bandwidth, and bandwidth is a limited resource.</p><p>Many applications distribute the same information to multiple receivers, but in many cases the same information is sent to a single receiver at a time, thus multiple copies of the same information is sent, thus consuming bandwidth.</p><p>What if the information could be broadcasted to all the clients at the same time, similar to a television broadcast. TCP/IP provides some means to do that. For example UDP supports broadcasting; the problem faced when using UDP is that it’s not reliable. There is no guarantee that the information actually reaches the clients.</p><p>This Bachelor thesis in Computer Science aims to investigate the problems and solutions of how to achieve reliable distribution of fixed size data sets using a non reliable multicast communication channel, like UDP, in a LAN environment.</p><p>The thesis defines a protocol (Almost Reliable Multicast Protocol – Arm-P) that provides maximum scalability for delivery of versioned data sets that are designed to work in a LAN-environment. A proof-of-concept application is implemented for testing purposes.</p>
7
Ramasubramaniam, Venkata Lakshmanan. "A framework for reliable multicast protocol." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000599.
Full text
8
Mostafa, Walid Farouk. "A distributed fault-tolerant multicast session protocol for reliable collaborative communications /." The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487943341529718.
Full text
9
Srinivas, Varun. "An efficient and fair reliable multicast protocol for 802.11-based wireless LANs." [Ames, Iowa : Iowa State University], 2009.
Find full text
10
Maamar, Haifa Raja. "A hybrid multicast transport protocol for collaborative virtual environments." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/28004.
Full textAbstract:
In recent years, we have witnessed a growing interest in the synchronous collaboration based class of applications. Several techniques for Collaborative Virtual Environments (CVE) and Collaborative Haptic, Audio and Visual Environments (C-HAVE) have been designed. However, several challenging issues remain to be resolved before CVE and C-HAVE technologies become a common place.
In this thesis, we focus on applications that are based on closely coupled and highly synchronized haptic tasks that require a high-level of coordination among the participants. Four main protocols have been designed, in the literature, to resolve the synchronization issues in collaborative virtual environments: the Synchronous Collaboration Transport Protocol (SCTP), the Selective Reliable Transmission Protocol (SRTP), the Reliable Multicast Transport Protocol (RMTP) and the Scalable Reliable Multicast (SRM). However, none of these protocols has been able to meet all of the basic CVE requirements, i.e., scalability, reliability, synchronization, and minimum delay.
In this thesis, we propose a hybrid multicast transport protocol, which we refer to as HMTP that aims at meeting the CVE requirements. We describe our protocol, discuss its implementation and report on the performance results we have obtained for two virtual tele-surgery training class of applications.
11
Asplund, Katarina. "Implementation and Experimental Evaluation of a Partially Reliable Transport Protocol." Licentiate thesis, Karlstad University, Division for Information Technology, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-2437.
Full textAbstract:
<p>In the last decade, we have seen an explosive growth in the deployment of multimedia applications on the Internet. However, the transport service provided over the Internet is not always feasible for these applications, since the network was originally designed for other types of applications. One way to better accommodate the service requirements of some of these applications is to provide a partially reliable transport service. A partially reliable transport service does not insist on recovering all, but just some of the packet losses, thus providing a lower transport delay than a reliable transport service. The work in this thesis focuses on the design, implementation, and evaluation of a partially reliable transport protocol called PRTP. PRTP has been designed as an extension to TCP in order to show that such a service could be effectively integrated with current protocol standards. An important feature of PRTP is that all modifications for PRTP are restricted to the receiver side, which means that it could be very easily deployed. The thesis presents performance results from various experiments on a Linux implementation of PRTP. The results suggest that transfer times can be decreased significantly when using PRTP as opposed to TCP in networks in which packet loss occurs. Furthermore, the thesis includes a study that investigates how users perceive an application that is based on a partially reliable service. Specifically, how users select the trade-off between image quality and latency when they download Web pages is explored. The results indicate that many of the users in the study could accept less than perfect image quality</p><p>if the latency could be shortened.</p>
12
Du, Yan. "A Progressively Reliable Image Transport Protocol over Wireless Sensor Networks." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27975.
Full textAbstract:
Images are extensively used in Wireless Multimedia Sensor Networks (WMSN) for surveillance and object monitoring. The transmission of image data constitutes a significant portion of network bandwidth. Given the inherent differences of Wireless Sensor Networks (WSN) from wired networks, such as high probability of non-congestion related packet loss, very low bandwidth, Quality of Service (QoS) requirements, and limited processing power, the traditional transport protocol---the Transmission Control Protocol (TCP)---is not suitable for transferring images over WSN. In this thesis, a Progressively Reliable Image Transport Protocol---PITP, is proposed. First, with the support of progressive JPEG and out-of-order delivery of packets, this new protocol can display images smoothly with incremental quality. Second, this protocol guarantees receiver-controlled reliability and sound congestion control. In addition, a synchronization control mechanism is proposed within the protocol. A series of experiments are designed and simulated with ns2 to evaluate the performance of PITP. According to the results, PITP is proved to be suitable for image transmission over WSN.
13
Sharif, Atif. "Reliable, congestion aware transport layer protocol for heterogeneous wireless sensor networks." Thesis, Curtin University, 2011. http://hdl.handle.net/20.500.11937/87.
Full textAbstract:
Energy is the biggest concern for any heterogeneous WSNs and achieving high energy efficiency is of paramount importance for the longevity of a heterogeneous WSNs. Communicating in- formation from the sensing region to the sink is a critical task in the entire operation of a heterogeneous WSNs. Such information needs to be reliably communicated, while avoiding any network congestion, from source to sink in order to ensure that application-specific Quality of Service objectives are met for any given scenario. This thesis developed several transport layer protocols to address the issues of congestion control, reliability assurance, simultaneously supporting heterogeneous traffic environment and energy efficiency for a heterogeneous WSNs.The first aim of the proposed research is to develop a congestion control scheme for a heterogeneous WSNs. The envisaged congestion control scheme has dual functionality. Firstly, it should be capable of handling the traffic heterogeneity and secondly, it intelligently assigns the source transmission rates and channel bandwidth for avoiding congested scenarios within the network, thereby avoiding any unnecessary packet retransmissions, due to packet drops caused by congestion. This produces high network good throughput, effective use of channel bandwidth, minimum E-2-E data packet latency etc. All the proposed transport layer protocol schemes e.g. End-to-End Reliable and Congestion Aware Transport Layer Protocol (ERCTP), Lightweight Congestion Aware Reliable Transport protocol (LCART) and Lightweight Congestion Aware Reliable Transport Protocol-implicit (LCARTi) are designed with this aim in mind.The second aim of the proposed research is to develop an intelligent reliability ensuring scheme capable of handling bidirectional reliability issues associated with data and control information flow within the heterogeneous WSNs. The design takes into account the variable nature of reliability assurance based on the nature of the traffic. For instance, multimedia flow is given a high reliability measure in comparison to scalar and non-event information flow, since the multimedia has a high retransmission cost. All the proposed transport layer protocol schemes such as ERCTP, LCART and LCARTi are designed in order to achieve this objective.The third aim of the proposed research is to develop a scheme that simultaneously handles the heterogeneous traffic flows within the same network. The proposed scheme has the intelligence to determine the nature of traffic and to allocate different bandwidth based on this nature in order to meet the stringent requirements as imposed by the application-specific QoS constraints like E-2-E data packet latency, high good throughput etc. All the proposed transport layer protocol schemes such as ERCTP, LCART and LCARTi are designed with this objective in mind.The fourth and final aim of the proposed research is to create a mechanism that merges the common functionalities of different layers of the WSNs communication stack in order to maximise energy efficiency. This involves finding the relationship between the transport and the lower MAC and wireless-physical layers of the WSNs communication stack. This merging will result in better utilization of network resources such as bandwidth, storage etc. and helps to achieve the objective of energy efficiency. Only the LCART and LCARTi designs achieve this proposed research aim.
14
Ramachandran, Sreeraj. "Cross-layer design methodology and anaylsis for reliable multicast transport over satellite networks." Thesis, University of Aberdeen, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.499718.
Full textAbstract:
The following document describes research and development of a cross layer design of two complementary topics: Reliable Multicast over satellite cross-layer design architecture The first topic investigates the capabilities of existing reliable multicast protocols and identifies the drawbacks using a variety of numerical and emulation models. Within this research topic a cross layer approach to designing multicast protocol is investigated and then compared with the existing techniques to show higher performance. Cross-layer security Framework The second topic investigates how network layer security can be provided in a cross layer architecture. This has led to the development of a new framework called Cross Layer IPsec (CL-IPsec). The performance of the new framework is compared with IPsec using emulation and numerical methods in this research topic and evidence of higher performance using CL-IPsec is shown. The two main parts are followed by conclusion and appendix sections. The important points from each chapter are summarised in the conclusion section; which is followed by a future work section that identifies further work that needs to be done in this field. The appendix contains list of publications that were generated as part of this research and schematic diagrams of CL-IPsec functions.
15
Anantharaman, Vaidyanathan. "Reliable transport over multihop wireless Ad Hoc Networks." Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/15427.
Full text
16
Koyabe, Martin W. "Appropriate and robust reliable multicast transport techniques for satellite networks experiencing persistent link fades." Thesis, University of Aberdeen, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274816.
Full textAbstract:
Over the last decade, the Internet has been experiencing an exponential growth in multimedia (i.e. voice and video) and bulk data traffic mainly generated by IP multicast applications. This surge in IP multicast traffic has led to a growing belief among many network infrastructure experts, that the current Internet should widely support IP multicast as a core transport service for both multimedia and bulk data traffic. IP multicast enables efficient use of bandwidth and scales to large groups of receivers (i.e. overheads at the source, per transport stream, remains constant with increasing number of receivers); which makes it an ideal transport service for alleviating congestion and minimising bandwidth usage over the current Internet infrastructure. This work, considers the use of next generation broadband satellite networks as a future complementary solution, for large-scale deployment of reliable IP multicast services over the present Internet infrastructure. It examines how different classes of reliable multicast transport techniques (suited for deployment over satellite networks) perform over link channels experiencing fades/outages similar to next generation satellite links. It then demonstrates how reliable multicast transport protocol techniques; can be optimised over next generation satellite networks. Based on experience gained in conducting benchmark experiments and performance analysis of a set of reliable multicast protocol techniques over varying link conditions, such as high loss rate (significantly due to persistent link fades) and propagation delay. Design specification and implementation of an optimised reliable multicast transport protocol, Satellite Reliable Multicast Transport Protocol (SAT-RMTP), suited for hybrid terrestrial-satellite network, has been presented. Analysis of SAT-RMTP performance over both terrestrial and satellite networks has been conducted and compared with similar protocols currently being proposed for standardisation in the IETF.
17
Mirzaei, Ahmad, and Seyedeh Serveh Sadeghi. "Adjustable, Delay-based Congestion Control in a Reliable Transport Protocol over UDP." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-94875.
Full textAbstract:
Hosts in the peer-to-peer networks need to communicate to each other directly, but majority of nodes in the Internet are private nodes, that is they are behind Network Address Translators(NAT), and cannot be reached directly like a public node. Therefore, NAT traversal techniques are required to enable nodes to make end-to-end connections. These techniques seems to be more effective over UDP transport compared to TCP. However, standard UDP lacks some useful features, such as reliability and in-order delivery of packets. It also does not have congestion control mechanism to prevent congestion in the links. In this protocol, named RABAT, we are going to present a transport library over UDP for peer-to-peer applications that provides a delay-based congestion control mechanism and also in-order delivery of packets. Our congestion control mechanism is derived from LEDBAT draft [8] and reliability implementation is based on standard TCP. RABAT provides both intra- and inter-protocol fairness, which in case of the latter is back-off to TCP. The protocol also enables users to change priority of the running transports at runtime. To the best of our knowledge, this is the first open-source implementation of LEDBAT in java.
18
Shi, Xiaohan. "A reliable real-time transport protocol for networked control systems over wireless networks." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/60160/1/Xiaohan_Shi_Thesis.pdf.
Full textAbstract:
Deploying wireless networks in networked control systems (NCSs) has become more and more popular during the last few years. As a typical type of real-time control systems, an NCS is sensitive to long and nondeterministic time delay and packet losses. However, the nature of the wireless channel has the potential to degrade the performance of NCS networks in many aspects, particularly in time delay and packet losses. Transport layer protocols could play an important role in providing both reliable and fast transmission service to fulfill NCS’s real-time transmission requirements. Unfortunately, none of the existing transport protocols, including the Transport Control Protocol (TCP) and the User Datagram Protocol (UDP), was designed for real-time control applications. Moreover, periodic data and sporadic data are two types of real-time data traffic with different priorities in an NCS. Due to the lack of support for prioritized transmission service, the real-time performance for periodic and sporadic data in an NCS network is often degraded significantly, particularly under congested network conditions.
To address these problems, a new transport layer protocol called Reliable Real-Time Transport Protocol (RRTTP) is proposed in this thesis. As a UDP-based protocol, RRTTP inherits UDP’s simplicity and fast transmission features. To improve the reliability, a retransmission and an acknowledgement mechanism are designed in RRTTP to compensate for packet losses. They are able to avoid unnecessary retransmission of the out-of-date packets in NCSs, and collisions are unlikely to happen, and small transmission delay can be achieved. Moreover, a prioritized transmission mechanism is also designed in RRTTP to improve the real-time performance of NCS networks under congested traffic conditions. Furthermore, the proposed RRTTP is implemented in the Network Simulator 2 for comprehensive simulations. The simulation results demonstrate that RRTTP outperforms TCP and UDP in terms of real-time transmissions in an NCS over wireless networks.
19
Fang, Jian. "Advanced Transport Protocols for Space Communications." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4959.
Full textAbstract:
Satellite IP networks are characterized by high bit error rates, long propagation delays, low bandwidth feedback links, and persistent fades
resulting from varying weather patterns. A new unicast transport protocol is designed to address all the above challenges. Two new algorithms, Jump
Start and Quick Recovery, are presented to replace the traditional Slow Start algorithm and to recover rapidly from multiple segment losses within one window of data. The characteristics of satellite IP networks also distinguish satellite multicasting from multicasting in terrestrial
wirelined networks. A reliable data multicast transport protocol, TCP-Peachtree, is proposed to solve the acknowledgment implosion and scalability problems in satellite IP networks. Developments in space technology are enabling the realization of deep space missions. The scientific data from these missions need to be delivered to the Earth
successfully. To achieve this goal, the InterPlaNetary Internet is proposed as the Internet of the deep space planetary networks, which is characterized by extremely high propagation delays, high link errors, asymmetrical bandwidth, and blackouts. A reliable transport protocol, TP-Planet, is proposed for data traffic in the InterPlaNetary Internet. TP-Planet deploys rate-based additive-increase multiplicative-decrease (AIMD) congestion control and replaces the inefficient slow start algorithm with a novel Initial State algorithm that allows the capture of link resources in a very fast and controlled manner. A new congestion detection and control mechanism is developed and a Blackout State is incorporated into the protocol operation. Multimedia traffic is also one part of the aggregate traffic over InterPlaNetary Internet backbone links and it has additional requirements such as minimum bandwidth, smooth traffic, and error control. To address all the above challenges, RCP-Planet is proposed. RCP-Planet consists of two novel algorithms, i.e., Begin State and Operational State. The protocol is based on a novel rate probing mechanism and a new rate control scheme to update the media rate smoothly based on the observed rate for the probing sequence.
20
Grinnemo, Karl-Johan. "A Study of Partially Reliable Transport Protocols for Soft Real-Time Applications." Licentiate thesis, Karlstads universitet, Avdelningen för datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-33933.
Full textAbstract:
The profileration of multimedia applications, such as streaming video, teleconferencing, and interactive gaming has created a tremendous challenge for the traditional transport protocols of the Internet – UDP and TCP. Specifically, many multimedia applications are examples of soft real-time applications. They have often relatively stringent require- ments in terms of delay and delay jitter, but typically tolerate a limited packet loss rate. In recognition of the transport service requirements of soft real-time applications, this thesis studies the feasibility of using retransmission based, partially reliable trans- port protocols for these applications. The thesis studies ways of designing retransmis- sion based, partially reliable transport protocols that are congestion aware and TCP com- patible. Furthermore, the transport protocols should provide a service that, in terms of performance metrics such as throughput, delay, and delay jitter, are suitable for soft real- time applications. The thesis work comprises the design, analysis, and evaluation of two retransmission based, partially reliable transport protocols: PRTP and PRTP-ECN. Extensive simulations have been carried out on PRTP as well as PRTP-ECN. These sim- ulations have in part been complemented by some theoretical analysis. The results of the simulations and the analysis suggest that substantial reductions in delay jitter and improvements in throughput can indeed be obtained with both PRTP and PRTP-ECN as compared to TCP. While PRTP reacted too slowly to congestion to be TCP-friendly and altogether fair, PRTP-ECN was found to be both TCP-friendly and reasonably fair. The thesis work also comprises an extensive survey on retransmission based, par- tially reliable transport protocols. Based on this survey, we have proposed a taxonomy for these protocols. The taxonomy considers two dimensions of retransmission based, partially reliable transport protocols: the transport service, and the error control scheme.
21
Ayran, Orhan. "Reliable Real-time Video Communication In Wireless Sensor Networks." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/2/12608233/index.pdf.
Full textAbstract:
Many wireless sensor network (WSN) applications require efficient multimedia communication capabilities. However, the existing communication protocols in the literature mainly aim to achieve energy efficiency and reliability objectives and do not address the multimedia communication challenges in WSN. In this thesis, comprehensive performance evaluation of the existing transport protocols is performed and it has been shown that the existing proposals achieve very poor performance in terms of large set of metrics such as packet delivery rate, end-to-end packet delay, bandwidth and energy efficiency, frame peak signal-to-noise ratio (PSNR), delay-bounded frame PSNR, frame delivery probability, frame end-to-end delay and jitter. Based on these results, an energy-efficient real-time and reliable video sensor communication protocol (VSCP) is introduced for WSN. VSCP estimates video quality perceived by sink using lost segments of video frames and aims to maintain the overall reliability at a given level with minimum energy expenditure. Source data rates are adjusted in a quality adaptable manner according to the network conditions and the overall reliability computed by sink. QSC (quality scalable coding) encoding technique is used to produce a nearly constant quality video at a given maximum data rate during adjustment of source data rates. Performance evaluations show that VSCP protocol significantly outperforms the existing proposals in terms of multimedia communication performance metrics in WSN.
22
Pandey, Manoj Kumar. "A Hop-by-Hop Architecture for Multicast Transport in Ad Hoc Wireless Networks." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd3119.pdf.
Full text
23
Grigorescu, Eduard. "Reducing internet latency for thin-stream applications over reliable transport with active queue management." Thesis, University of Aberdeen, 2018. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=236098.
Full textAbstract:
An increasing number of network applications use reliable transport protocols. Applications with constant data transmission recover from loss without major performance disruption, however, applications that send data sporadically, in small packets, also called thin-streams, experience frequently high latencies due to 'Bufferbloat', that reduce the application performance. Active Queue Management mechanisms were proposed to dynamically manage the queues in routers by dropping packets early and reduce these, hence reducing latency. While their deployment to the internet remains an open issue, the proper investigation into how their functioning mechanism impacts latency is the main focus of this work and research questions have been devised to investigate the AQM impact on latency. A range of AQM mechanisms has been evaluated by the research, exploring performance of the methods for latency sensitive network applications. This has explored new single queue AQM mechanisms such as Controlled Delay (CODEL) and Proportional Integral Enhanced (PIE) and Adaptive RED (ARED). The evaluation has shown great improvements in queuing latency when AQM are used over a range of network scenarios. Scheduling AQM algorithms such as FlowQueue CODEL (FQ-CODEL) isolates traffic and minimises the impact of Bufferbloat on flows. The core components of FQ-CODEL, still widely misunderstood at the time of its inception, have been explained in depth by this study and their contribution to reducing latency have been evaluated. The results show significant reductions in queuing latency for thin streams using FQ-CODEL. When TCP is used for thin streams, high application latencies can arise when there are retransmissions, for example after dropping packets by an AQM mechanism. This delay is a result of TCP's loss-based congestion control mechanism that controls sender transmission rate following packet loss. ECN, a marking sender-side improvement to TCP reduces applicationlayer latency without disrupting the overall network performance. The thesis evaluated the benefit of using ECN using a wide range of experiments. The findings show that FQ-CODEL with ECN provides a substantial reduction of application latency compared to a drop-based AQM. Moreover, this study recommends the combination of FQ-CODEL with other mechanisms, to reduce application latency. Mechanisms such as ABE, have been shown to increase aggregate throughput and reduce application latency for thin-stream applications.
24
Hrastar, Scott E. "An available bit-rate service class for multicast IP transport over satellite using online measurement and wavelet-based predictive bandwidth allocation." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/14837.
Full text
25
Solera, Delgado Marta. "Control de congestión multipunto en redes IP y ATM. Diseño de protocolos de transporte multipunto fiable." Doctoral thesis, Universitat Politècnica de Catalunya, 2006. http://hdl.handle.net/10803/7038.
Full textAbstract:
Las comunicaciones multipunto ofrecen, tanto a usuarios como a proveedores, mayor eficiencia, permitiendo desarrollar e implantar nuevos servicios. Para poder desplegarlos adecuadamente sobre la redes de comunicaciones, es necesario contar con protocolos adecuados a todos los niveles.<br/>El soporte de conexiones multipunto, que es inmediato en muchas redes de ordenadores, por la existencia de un medio compartido, no lo es en una red ATM o en una red IP. En este tipo de redes, ofrecer una comunicación multipunto requiere de mecanismos complejos que coordinen y controlen la transmisión de información entre las fuentes y los receptores. Esta tesis doctoral estudia las comunicaciones punto a multipunto sobre las redes ATM e IP. En concreto, se diferencian dos objetivos: <br/>· Estudiar, analizar y proponer un control de flujo punto a multipunto en la categoría de servicio Available Bit Rate (ABR) en redes ATM.<br/>· Diseñar, analizar y simular un protocolo de transporte punto a multipunto fiable con control de congestión de tasa única para redes IP.<br/>El control de flujo de ABR fue diseñado para comunicaciones punto a punto. Para el caso multipunto, los conmutadores deben desarrollar mecanismos que limiten y agreguen el tráfico de realimentación. Se ha desarrollado un algoritmo de consolidación que asegura que la agregación de la información de realimentación se realiza de forma correcta, mejorando la convergencia de propuestas anteriores. Este mecanismo se ha modelado matemáticamente, y se ha validado mediante simulación.<br/>En cuanto a las comunicaciones multipunto en Internet, en este trabajo se ha desarrollado un protocolo de transporte punto a multipunto fiable, RCCMP, diseñado para ser escalable, fiable y con un control de congestión de tasa única que comparta el ancho de banda equitativamente con TCP.<br/>El control de congestión ha sido planteado como una parte esencial del protocolo, y no como ocurre en muchas propuestas, como un componente adicional que debe ser ajustado a un protocolo de transporte. En RCCMP se combinan los objetivos de regular la tasa de transmisión y de conseguir una comunicación fiable, con el fin de simplificar y limitar el número de confirmaciones negativas que se envían desde los receptores. Para la evaluación de las prestaciones de RCCMP, se ha implementado el protocolo en el simulador ns-2. <br/>Se ha modelado el caudal de este protocolo de transporte multipunto en función de la tasa de pérdidas y del tiempo de ida y vuelta. La principal contribución de nuestro modelo radica en la caracterización del caudal ante cambios de representante. También, se ha desarrollado un método de análisis para estimar el ancho de banda consumido por cualquier protocolo de transporte. La principal diferencia con otros trabajos es que éstos se centran únicamente en el coste de los procesos del control de errores.<br/>Para mejorar el rendimiento de RCCMP, se ha definido y simulado otro protocolo de transporte punto a multipunto fiable de tasa única, RVCMP, que incluye un control de congestión que emula al de la implementación TCP Vegas.<br>Multicast communications are profitable for service providers increasing intermediate node performance and reducing traffic in their networks. In the other side, multicast benefits also the users, who are able to enjoy collaborative applications and other multicast applications. <br/>IP and ATM network were designed to support point to point communications. The new multicast generation applications such multimedia conference, shared workspace, distance learning introduce new requirements in data transmission. <br/>There are at least two problems that differentiate between unicast and multicast control schemes in ATM networks with ABR service. First, there is the problem of feedback implosion. The volume of feedback traffic returning to the source increases proportional to the number of destinations. Second, there is the problem of consolidation noise. It can occur when feedback from some leaves is not always received in a timely fashion at the time when RM cells need to be returned by the branch point. One of the proposals to provide multicast communications is to extend unicast traffic management control methods. One of its practical realization schemes is the extension of Enhanced Proportional Rate Control Algorithm (EPRCA) for point to multipoint connections. That proposal suffers from consolidation noise, in order to solve this drawback, a new algorithm is proposed. An analytical approach is used to quantitatively evaluate their performance by using first-order fluid approximation method.<br/>About IP multicast communications, we propose a new protocol, called RCCMP (Reliable Congestion Controlled Multicast Protocol). It has been designed to be simple, scalable (NAK suppression), reliable and TCP-friendly. The congestion control is a central part of the protocol, where the feedback of the worse receiver is used to control a transmission window in a TCP-like fashion. The scalability issue is addressed with an exponential timer scheme that is also used to estimate the number of receivers involved in the communication. The protocol neither needs support from network elements nor maintains state information dependent of the number of receivers. This protocol has been developed in ns-2 (network simulator-2) for validating.<br/>We develop a simple analytic characterization of the steady-state send rate as a function of loss rate and round trip time (RTT). The main contribution is that our model captures the representative changes. Also, we provide a new approach to estimate the link usage of multicast reliable transport protocols. It can be used as a benchmark to evaluate their scalability. We have chosen, as a case study, a multicast reliable transport protocol called RCCMP. The link cost is due to data, retransmitted data, and characteristic packets of multicast protocols such as control packets: control packets for estimating the number of receivers involved in the session and for getting multicast reliability. <br/>For improving performance, we present RVCMP (Reliable Vegas Congestion controlled Multicast Protocol) that has been designed to be simple, scalable, reliable and TCP-friendly. The congestion control developed is a single-rate scheme where the feedback of the worst receiver is used to control a transmission window in a TCP Vegas-like fashion. The proposal takes the advantage from TCP Vegas of operating without inducing packet losses as a signal that there is congestion in the network to achieve a better performance. To evaluate the benefits of Vegas-like congestion control, the performance of RVCMP is compared to an analogous protocol that is based on a TCP Reno congestion control, RCCMP.
26
Fang, Tian. "Reliable multicast transport protocol implementation building blocks." Thesis, 2004. http://spectrum.library.concordia.ca/7923/1/MQ91028.pdf.
Full textAbstract:
In order to provide reliable IP multicast services, multiple Reliable Multicast Transport Protocols (RMTPs) have been developed. However, because there exist different definitions of "reliability", no single RMTP can meet all requirements of different applications. The research focus of RMTPs has changed from individual protocols to the protocol building blocks. This change of focus provides impetus for this thesis describing RMTP implementation building blocks. The Meta-Transport Library (MTL) was designed to implement RMTPs. Nonetheless, due to its limits, the MTL is insufficient to be used as the basis for the RMTP implementation building blocks. The RMTP implementation building blocks presented in this thesis provide a framework and a full set of common components that can be used to implement a wide range of RMTPs.
27
Chu, Chi Wei, and 朱祁偉. "Transport Protocol Supports for Reliable Multicast Communition." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/83053570376527121608.
Full textAbstract:
碩士<br>國立臺灣大學<br>資訊管理學研究所<br>85<br>This paper presents the design of a reliable, connection-oriented multicast
transport layer protocol called Multicast Transmission Control Protocol (MTCP).
MTCP provides sequenced lossless delivery of data from one sender to multiple
receivers. It operates in the Internet, a heterogeneous network composed of
different receivers with diverse data transfer capacity, and assumes the use of
Internet IP multicast service. It maximize the receiving data rate of
individual receivers, and minimize the overhead of the sender. Several features
are used to achieve these design goals: destination grouping, multi-window flow
control, packet pre-buffering, negative acknowledgment and Era-based packet
retransmission, periodic transmission of sender report and receiver report
packets between sender and receivers to keep track of how well receivers are
receiving data.
We also present some simulation result of MTCP with receivers located at
various sites of Internet, and discuss the impact of destination grouping, Era
length, SR, RR, NACK retransmission frequency on the MTCP performance.
28
Wang, Tianyu. "Tree auto-configuration for the reliable multicast transport protocol." Thesis, 2002. http://spectrum.library.concordia.ca/1723/1/MQ68485.pdf.
Full textAbstract:
The Reliable Multicast Transport Protocol is a hierarchical transport level protocol for IP multicast that provides reliable data transmission. The objective of this thesis is to define and implement the Tree Auto-Configuration algorithm, which generates a tree topology used for tree based reliable multicast transport protocols. The tree topology is comprised of a pre-deployed mesh, multiple senders, local service nodes, and a large number of receivers. We implement this algorithm in C++ based on Meta-Transport Library, which is a set of C++ base classes designed to present an infrastructure for building transport protocols.
29
Chi, Jenn-Jong, and 戚振中. "Reliable Multicast Transport Protocol with Dynamic Designated Receiver Adjustment." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/09039856243186510219.
Full textAbstract:
碩士<br>國立交通大學<br>資訊工程系<br>87<br>Multicasting is a technique to use the network efficiently for group communication applications. It effectively utilizes network resources by sending only one packet to all group members instead of sending multiple copies of the same data to each individual member.
Research in [27] have showed that the tree-based multicast transport protocol is the best choice for reliable multicast protocol design. Besides, Markus [18] pointed out the designated points (DRs), which are responsible for retransmitting lost packets in tree-based protocol, should be adapted to the dynamic change of the network traffic and the group member. Reliable multicast transport protocol (RMTP) is a tree-based protocol, but it is unable to accommodate the dynamic change mentioned above. In this thesis, we propose both a centralized and a distributed scheme based on RMTP to dynamically adjust DRs.
In our schemes, the generation and release of a new DR depends on the loading of its parent DR and the length of retransmission path from the parent DR to the receiver. In centralized scheme, a parent DR manages the process of DR adjustment. While in distributed scheme, the new DR adjustment is controlled among receivers. We show that schemes have much better performance than the raw RMTP in terms of average retransmission latency and DR load balancing.
30
Ke, Chien-an, and 柯建安. "Reliable Mobile Multicast Protocol (RMMP)." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/80505695932588412642.
Full textAbstract:
碩士<br>國立臺灣大學<br>電機工程學研究所<br>89<br>IP multicasting is an important technology for many existing and emerging applications on the Internet. Multicast can be either reliable or unreliable. Generally speaking, a certain degree of error for multimedia applications can be tolerated, but there are still many multicast applications that require network protocols providing services as reliable as TCP. A reliable multicast protocol must employ mechanisms to cope with packet losses, errors, duplications, and out-of-order deliveries of datagrams. The addition of mobile hosts compounds the complexity of the reliable multicast problem because these mobile devices are usually limited in terms of power and memory, and the error rate of wireless link is high. Therefore, to provide reliable multicast services to these mobile devices appears to be a not only challenging but also urgent problem.
Most of the reliable multicast protocols so far proposed focus on stationary users on fixed networks with a permanent IP and consequently fail to provide an environment available for both mobile and fixed hosts. In this thesis, I will first study the basic operation of Mobile IP unicast and multicast and subsequently survey current reliable multicast solutions for mobile environments. Furthermore, I will propose a new reliable mobile multicast protocol based on Mobile IP with minimum changes; I will also compare its efficiency with existing protocols through conducting simulations. These simulation results can well demonstrate my proposed protocol lessens buffer requirement and betters system throughput and performance.
31
Wu, Chun-Ting, and 吳俊廷. "Reliable Multisource Multicast Protocol over MANET." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/2nr4y6.
Full textAbstract:
碩士<br>國立臺北科技大學<br>資訊工程系研究所<br>99<br>MAODV (Multicast Ad-hoc On-demand Distance Vector), a well-known multicast routing protocol in MANETs, has been proposed over ten years. It is originally designed for single-source multicast applications and thus inefficient when applied to multisource scenario. In addition, MAODV requires a route rediscovery procedure to recover multicast routing tree from partition of the delivery tree and takes a long time to recover the multicast routing whenever the root of the tree failed.
We apply four mechanisms(ERS, mobility prediction, virtual mesh and bidirectional multicast data delivery) to improve the performace of the MAODV protocol for multisource multicast applications. By modifying the MAODV protocol, this research presented a multisource multicast routing and partition recovery scheme in MANETs. Simulation results demonstrated that the proposed multisource multicast routing method can improve the bottleneck problem of MAODV in data delivery and the proposed partition recovery scheme can achieve shorter recovery time than that of MAODV with the lower control overhead.
32
Lee, Cheng-Hao, and 李振豪. "A Reliable Multicast Protocol over Vitrual Interface Architecture." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/48486578087856161279.
Full textAbstract:
碩士<br>國立清華大學<br>電機工程學系<br>89<br>The VIA is an effective and reliable network interface for SANs. Although the VIA enables low-latency and high-bandwidth communication for cluster computing, the specification only provides a minimal set of primitive functions for sending/receiving single messages. In this thesis, we present a reliable multicast protocol over VIA (RMVIA). We define two types of communication topologies and provide transmission protocol and error control. Several design issues to implementing the protocol: synchronization, pre-posting constraint, duplicated data transfer, single-threading and reliability. They can be solved by handshaking mechanism that we define in RMVIA. The transmission latency of RMVIA is short. In a small multicast group, to transmit 32kbyte data to six hosts, the RMVIA only spends about 1.6msec. In a large multicast group, if the sender transmits 32kbyte data to 35 hosts, RMVIA spend 2.56ms.
33
Liu, Yi-Hung, and 劉益宏. "Reliable Multicast Routing Protocol by Multicast Forwarder Agent in Mobile IP Networks." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/71316773181013225804.
Full textAbstract:
碩士<br>國立成功大學<br>電機工程學系碩博士班<br>91<br>Recently years, providing multicast services to hosts becomes popular and many multicast protocols have been proposed. Mobile IP uses two approaches for mobile multicasting, namely, remote subscription and bi-directional tunneling. Remote subscription enjoys efficient delivery, but suffers from serious packet loss and wastes a lot of time on reconstructing multicast tree during roaming. Bi-directional tunneling wastes less time on reconstructing multicast tree and is free from packet losses due to roaming; however, it suffers from inefficient delivery path and the triangular routing problem which results in inefficient routing on multicasting.
In order to diminish these drawbacks, this paper propose a new protocol to provide efficient and reliable multicast services for mobile IP networks. The new protocol improves the efficient of delivery with less number of packets for reliability. It can also get balance between the length of routing path and the time used to route. This reliable multicast routing protocol is derived from the use of the remote subscription and using MFA （multicast forwarding agent） to reduce the times of reconstructing the multicast tree. Multicast forwarding agent routes the missing datagrams caused by the out-of-synch problem to prevent roaming from packet loss and data duplication which may cause inefficient routing. Besides using the hierarchical routing recovery policy is for avoiding the ACK implosion.
The results of simulation show that this protocol has higher delivery efficiency in comparison with bi-direction tunneling and use less packets for routing which will provide more reliability and could be easier to recover from packet loss during roaming.
34
Yuan, Jia-Bin, and 袁嘉彬. "Delay-Sensitive And Reliable Multicast Query Protocol in WSN." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/65365265398050766814.
Full textAbstract:
碩士<br>國立臺灣大學<br>電機工程學研究所<br>96<br>Sensors are small, low-cost, wireless computing devices that sense information such as light and humidity at extremely high resolutions. Sensor technology has enabled a broad range of ubiquitous computing applications, such as agricultural, industrial, and environmental monitoring. Because sensor network is application-driven, its network protocol stack designs are different form applications to applications. In this paper, we present a reliable, energy-saving and delay-sensitive multicast query and reporting pro-tocol in this proposal. This protocol is especially suitable for applications that periodi-cally query multiple destinations, and collect sensed data from queried sensor nodes in a timely, reliable and energy-efficient way. This protocol contains two major component, efficient multicast query and energy-saving response. For ensuring both transmission reliability and system efficiency, we introduce R-ACK mechanism modified from hop-by-hop ACK into our proposed protocol. The main idea of this protocol design is that each nodes uses Transmission Status Table to record the transmission states of its child-ren nodes toward multicast query destinations. With Transmission Status Table design along with proper retransmission timer design, we can efficiently reduce transmission times to prolong nodes’ life. To achieve real-time delay guarantee, the adjustable re-transmission timer is one essential component in this protocol. For taking advantage of the nature of wireless transmission and conserving energy, promiscuous mode and PS (power saving) mode are introduced into our protocol. We evaluate our design on a 10~20-node sensor network. The results show that our proposed protocol largely in-creases reliability and performs high scalability.
35
Yuan, Jia-Bin. "Delay-Sensitive And Reliable Multicast Query Protocol in WSN." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-2807200820150100.
Full text
36
蘇軒緻. "A Tunnel-Based Reliable Mobile Multicast Protocol with Packet Reserve." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/81602913402922604718.
Full textAbstract:
碩士<br>國立中興大學<br>資訊科學研究所<br>92<br>Multicasting technology can improve the bandwidth utilization, when many users need the same data from the source. In recent years, with the fast-growing adoption of wireless networks and their limited bandwidth, multicasting is getting more important for applications in wireless network.
In this thesis, we propose a reliable mobile multicast protocol with packet reserve (RMMP-PR) to guarantee that the mobile host can correctly receive multicast packets from multicast group. IP multicasting is always under the UDP transport protocol, but UDP transport protocol doesn’t provide a reliable end-to-end transmission. The new functional entity, mobility agent (MA), is used to solve the out-of-synch problem when mobile hosts handoff and to provide a reliable end-to-end transmission. By using the service status messages between MAs, RMMP-PR reserves multicast packets and reduces the number of out-of-synchs when mobile hosts move between base-stations. Furthermore decreasing numbers of tunnel packets can make have a more efficient use of the bandwidth.
37
Chuang, Sheng-Yan, and 莊勝彥. "A Novel Timer Configuration Mechanism for the Scalable Reliable Multicast Protocol." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/51299562137376021948.
Full textAbstract:
碩士<br>國立中正大學<br>通訊工程研究所<br>90<br>This paper presents a new Timer configuration method for the Scalable Reliable Multicast (SRM) protocol, referred to as TSRM. To provide reliable service for multicasting, several reliable multicast approaches have been proposed. SRM is a typical example which adopts a timer-based approach to provide reliable delivery. TSRM enhances reliability and scalability of the SRM by partitioning locations of session members into logical topologies. A receiver in TSRM dynamically configures timers of issuing a negative acknowledgement (NACK) and a repair packet based on the logical topology dynamically constructed from control messages. Simulations are performed to justify the improvement by comparing the performance of TSRM with the original SRM.
38
Yu, Yao-Cheng, and 游曜丞. "A reliable transport protocol in wireless sensor network." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/95604585553950802283.
Full textAbstract:
碩士<br>淡江大學<br>電機工程學系碩士班<br>94<br>Wireless sensor networks are composed of various micro sensor nodes. Each sensor node has the ability of sense, wireless communication and data processing. The sensor nodes can transfer the collected information to the base station. With the feature of sensor node, the wireless sensor networks can be used in different fields.
Many problems may influence many layers top-down from the application layer to the physical layer. The energy consumption, the network safety, the congestion control, and the data dissemination reliability etc. They should be considered when we design the wireless sensor network. The influence of the transport protocols are congestion control, the data dissemination reliability and the energy consumption
In this paper, the “high reliability transmission” type and the “congestion control” type are the research objective. They all have their own problems and they can’t supply the requirements of every application. The “high reliability transmission” type keeps the packet delivery having high reliability with the recovery scheme. But this type doesn’t have the congestion control scheme. When the congestion happens, the coming packets will be dropped because of the full cache. It decreases the delivery success ratio and increases the resource consumption. The “congestion control” type is on the contrary. This type can overcome the congestion to decrease the loss packets due to the congestion. But this type can’t recovery the loss packets due to the bad quality of transmission channel. Therefore, this type can’t have high transmission reliability when the environment has bad quality of transmission channel. And we design a new protocol. We wish the protocol can supply the requirements of every application and can be used in any environment without modification.
Our new protocol includes recovering the loss packets due to the bad transmission quality. And we use a report message to control the network transmission to avoid the packets being dropped due to the congestion. With the functions, our new protocol can be used in the bad transmission quality environment or the heavy traffic network.
39
Wang, Tan. "A User-level, Reliable and Reconfigurable Transport Layer Protocol." Thesis, 2009. http://hdl.handle.net/10012/4568.
Full textAbstract:
Over the past 15 years, the Internet has proven itself to be one of the most influential inventions that humankind has ever conceived. The success of the Internet can be largely attributed to its stability and ease of access. Among the various pieces of technologies that constitute the Internet, TCP/IP can be regarded as the cornerstone to the Internet’s impressive scalability and stability. Many researchers have been and are currently actively engaged in the studies on the optimization of TCP’s performance in various network environments.
This thesis presents an alternative transport layer protocol called RRTP, which is designed to provide reliable transport layer services to software applications. The motivation for this work comes from the fact that the most commonly used versions of TCP perform unsatisfactorily when they are deployed over non-conventional network platforms such as cellular/wireless, satellite, and long fat pipe networks. These non-conventional networks usually have higher network latency and link failure rate as compared with the conventional wired networks and the classic versions of TCP are unable to adapt to these characteristics. This thesis attempts to address this problem by introducing a user-level, reliable, and reconfigurable transport layer protocol that runs on top of UDP and appropriately tends to the characteristics of non-conventional networks that TCP by default ignores. A novel aspect of RRTP lies in identifying three key characteristic parameters of a network to optimize its performance.
The single most important contribution of this work is its empirical demonstration of the fact that parameter-based, user-configurable, flow-control and congestion-control algorithms are highly effective at adapting to and fully utilizing various networks. This fact is demonstrated through experiments designed to benchmark the performance of RRTP against that of TCP on simulated as well as real-life networks. The experimental results indicate that the performance of RRTP consistently match and exceed TCP’s performance on all major network platforms. This leads to the conclusion that a user-level, reliable, and reconfigurable transport-layer protocol, which possesses the essential characteristics of RRTP, would serve as a viable replacement for TCP over today’s heterogeneous network platforms.
40
Wang, Ren-Di, and 王仁地. "A Reliable Multicast Routing Protocol Based on Recovery Points in Ad-hoc Wireless Networks." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/78668938411667160449.
Full textAbstract:
碩士<br>逢甲大學<br>資訊工程所<br>92<br>Multicasting is an essential service for mobile ad-hoc networks. A major challenge of multicasting in mobile ad-hoc networks is unstable forwarding path. This work presents a reliable multicasting protocol for mobile ad-hoc networks. A virtual backbone is used as a shared structure for multiple sessions, and a lost packet recovery scheme is developed for reliable packet transmission, called Recovery Point (RP) scheme. The RP scheme keeps copies of data packets of the source for recovering lost packets for its downstream RPs. A mergence scheme for RP is proposed to avoid the excessive control overhead. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and multicast efficiency. Furthermore, the simulation results also demonstrate that our approach is stable in networks with high mobility.
41
Ding, Shiling Yuan Xin. "The design, implementation and evaluation of a reliable multicast protocol for ethernet switched networks." 2003. http://etd.lib.fsu.edu/theses/available/etd-09172003-175446/.
Full textAbstract:
Thesis (M.S.)--Florida State University, 2003.<br>Advisor: Dr. Xin Yuan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Apr. 7, 2004). Includes bibliographical references.
42
Li, Sheng-Kun, and 李勝焜. "WPAN-ATP: A Reliable Transport Protocol for Wireless Personal Area Network." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/80385015648692907329.
Full text
43
Li, Meng Shu, and 李孟書. "Multicast real-time transport protocol and bridge architecture for interconnected high-speed LANs." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/18396723393518979335.
Full text
44
Ching-YuanLin and 林清元. "A Split Reliable Transport Protocol Using the Congestion Avoidance Mechanism over the VANET Environment." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/3eeq59.
Full textAbstract:
碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>101<br>To have reliable transmission in the VANET environment, a Split Reliable Transport Protocol (SRTP) is proposed in this thesis. The basic idea of SRTP is to separate a long connection into several sub-connections in order to reduce the overhead of packet retransmission, in which the length of each sub-connection depends on links’ states between vehicles. Three main issues that need to be resolved for SRTP are (1) how to decide the length of each sub-connection when a connection is established initially, (2) how to enhance the connection’s stability after the connection is established to deal with the fast topology change in the VANET environment, and (3) how to deal with packet congestion. An estimative scheme using location and speed information of vehicles to estimate the connectivity time of the links between vehicles are used in SRTP. The estimated values can be used to decide the lengths of sub-connections and adjust them dynamically. Another mechanism named Channel Busy Rate Aware (CBRA) congestion avoidance is proposed to avoid network congestion in the ad hoc network environment. In CBRA, busy rate and utility rate of the wireless channel for every node are used to adjust the source’s transmission rate and to avoid congestion. The simulation results show that SRTP can be operated well in the VANET environment and the aforementioned three issues can be appropriately resolved.
45
Wu, Geng-Ken, та 吳庚肯. "Ａ New Event-to-Sink Reliable Transport Protocol with Priority-Based Early Dropping Mechanisms in WSNs". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/24742150865328165534.
Full textAbstract:
碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>96<br>The observer obtains information collected by the sensor network about phenomenon. The observer decides event features based on the collective reports by the sensor network. Transport protocol in transport layer of wireless sensor network is UDP-type. But UDP-type transport protocol is not reliable in the transmission. Therefore it is possible to occur loses when packets are delivered to the sink. It can affect observer regarding the accuracy of deciding event features when there are too many lost packets. In order to enhance the reliability of detecting event features, we hoped the affiliation by reducing the transmission time interval of sensor nodes. So sensor nodes can deliver packets many times and promote the probability that packets are successfully delivered. But deliver packets massively, it is possible to cause the network congestion. It could cause packets to drop during network congestion and reduce the probability that packets are successfully delivered. But UDP-type transportprotocol lacks of a congestion control mechanism. It is unable
during network congestion situation to inform sensor nodes in the event scope to adjust their transmission time interval to a longer time for relieving the congestion situation.
In accordance to this demand, event-to-sink transport protocol was proposed. This protocol affiliation by the regulation transmission time interval of sensor node enables the packet number which sink received to achieve the observer hoped total number of packets at each duration to decide event features. This protocol contains a congestion control mechanism. It can be during network congestion to inform sensor nodes in the event scope to adjust their transmission time interval to a longer time for relieving the congestion situation. The sink calculated the updated transmission time interval by all of the packets which sink received at the end of decision interval. The sink sent control messages to sensor nodes in the event scope and updated their transmission time interval. There are two disadvantages of this method. One is that it needs too many control messages and the other is that it needs a long time to resolve the congestion.
In this thesis, we propose a new event-to-sink reliable transport protocol for improving the above shortcoming. We let source nodes to reduce their transmission time interval by a fixed ratio. It doesn’t need that the sink calculated the updated transmission time interval and sent control messages to sensor nodes in the event scope,
therefore We reduced the control overhead. We use a congestion detection mechanism based on local buffer monitoring in sensor nodes. When sensor nodes detect the congestion, they send control messages to inform source nodes the congestion immediately. Source nodes which receive the control message set their transmission time interval to the initial value. By this method, we improve the shortcoming that it needs a long time to resolve the congestion in the network. Furthermore, we use a priority-based early dropping mechanism. The purpose of this mechanism is that it can save the packets with high priority when sensor nodes need to drop packets. We simulate an application for monitoring temperature in our simulation.And the simulation results show that our transport protocol can achieve the event reliability
which the observer needs in grid network topology , in random network topology, as well as under multiple concurrent events. Our protocol reduces the control overhead and the dropping probability is improved form 8% to 5% compared with other transport protocol. We can save 5 % of the energy consumption in each sensor node because our method reduces the control overhead and the dropping probability.