Paper summary: The paper proposes a versatile protocol to allow for communication across diverse packet-switching networks requiring only a modest set of features to be supported by the participating networks. Strengths

Download 6.21 Kb. Date 31.01.2017 Size 6.21 Kb. #13077

Navigate this page:

• Limitations and Areas for improvement
• Relevance/Future Work

Paper summary: The paper proposes a versatile protocol to allow for communication across diverse packet-switching networks requiring only a modest set of features to be supported by the participating networks. Strengths: The solution presented enables diverse networks to interconnect without encroaching onto a network’s sovereignty and does so with the most minimal set of demands from the participating networks. Thus it allows the creation of heterogeneous networks that can be recursively grouped to create increasingly large networks. The paper is downright visionary for its time. It solves a lofty goal by proposing technologies that are still in play today. Gateways, global network addressing, multiplexing using ports, the TCP/IP protocol are some of the groundbreaking technologies that can be accredited to this paper. The proposed protocol has an ambitious feature set while keeping it simple to implement and execute over a variety of systems. Implicit ACKS, use of sliding windows instead of dynamic buffers to enable flow control, timed retransmission (implicit NACKS), and packet-fragmentation are all great ideas that made such a protocol possible. One of key strengths of this paper is its analysis of the protocol at varying scales: It talks about the economic implications of book-keeping and packet fragmentation at gateways; It talks about implementation details down to the level of cyclic buffers and process-protocol interface; It proposes security features to avoid 3rd party message snooping. Limitations and Areas for improvement: The paper fails to see some obvious flaws in the proposed algorithm from not having actually implemented it: It allows for an adaptive window size to enable flow control but fails to realize that timeouts need to be equally adaptive. When packets are fragmented at gateways the checksums are not recomputed for individual fragments. Consider a packet that has to pass through a gateway that will split it into 10 parts with a 10% error rate. This packet might be retransmitted infinitely. The paper states several times that the windows-size has to be less than sequence-ids/2. This limit is dependant on the network capacity. For high capacity networks this window-size has to be several orders of magnitude smaller than the proposed limit. The addressing scheme allows for only 256 fixed-size networks The protocol does not consider an adaptive congestion control to augment its proposal for flow control. Relevance/Future Work: At the time the authors called for further analysis of the protocol specification and an actual implementation of the protocol. This has been done since then. The paper laid out the groundwork for several internet technologies in existence today. The strengths and weakness of this paper continue to affect internet users to this day. The paper is also an inspiration to researchers in the networking field, or in any other field for that matter, in terms of the impact it has had. Directory: courses courses -> Algorithms for Register Allocation Andrew Pardoe courses -> Ieor 4600 Mixed-Integer Rounding Inequalities courses -> San José State University Social Science/Psychology Psych 175, Management Psychology, Section 1, Spring 2014 courses -> Kennan's Telegram (Excerpt) courses -> The university of british columbia courses -> A hurricane track density function and empirical orthogonal function approach to predicting seasonal hurricane activity in the Atlantic Basin Elinor Keith April 17, 2007 Abstract courses -> Cover page need figure & title by Proposed Table of Contents courses -> Objectives courses -> Dr. Jeff Masters' WunderBlog Download 6.21 Kb. Share with your friends: