DOCSLIB.ORG

Chapter 4 Introduction to Network Layer

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 4 Introduction to Network Layer Chapter 4 Introduction to Network Layer Kyung Hee University 1 4.1 Introduction At the conceptual level, we can think of the global Internet as a black box network that connects millions of computers Application Application Transport Transport Network Network Data link Data link Physical Physical Internet A B Kyung Hee University 2 Internet as a combination of LAN and WANs Internet is made of many networks (or links) connected together through the connecting device Internet is a internetwork, a combination of LANs and WANs Kyung Hee University 3 4.2 Switching Circuit Switching A physical circuit is established between the source and destination of the message before the delivery of the message The source informs the network that transmission is complete The network opens all switched for another devices A good example of circuit-switched network early telephone system Packet Switching The network layer in the Internet today : packet-switched network A message from the upper layer is divided into the packets The source sends packets to destination one-by-one The packet switched network decides the route of the message from source to final destination Classification : Datagram, Virtual Circuit Kyung Hee University 4 4.2 Switching (con’t) In circuit switching, the whole message is sent from the source to the destination without being divided into packets. In packet switching, the message is first divided into manageable packets at the source before being transmitted. The packets are assembled at the destination. Kyung Hee University 5 4.3 Packet Switching The network layer is designed as a packet-switched network The packet at the source is divided into manageable packets, called datagram Individual datagrams are transferred from source to the destination The received datagrams are assembled at the destination before recreating original message Provided services Connectionless service Connection-oriented service Kyung Hee University 6 Connectionless Packet-Switched Network Each packet is routed based on the information contained in its header There is no relationship between packets The switches in this type of network are called routers Network A connectionless packet-swtiched network R1 R2 4 3 2 1 2 Sender 1 Network 4 2 3 R4 1 3 3 4 1 3 4 2 R3 R5 Out of order Kyung Hee Receiver University 7 Forwarding Process in Connectionless Network The router routes the packet based only on the destination address Legend SA: Source address Routing table DA: Destination address Destination Output address interface A 1 B 2 H Send the packet 3 out of interface 2 Destination address SA DA Data 1 2 SA DA Data 3 4 Kyung Hee University 8 Delay in a Connectionless network Destination Souce 1 y a l e d 2 l a t o T 3 Time Time Time Time Kyung Hee University 9 Connection-Oriented Service Connection setup, data delivery, teardown processes are used to provide the service There is a relationship between all packets belonging to a message A virtual connection should be set up to defines the virtual path the packet should follow After connection setup, the datagrams can follow the same path The packet must contain a flow label, a virtual circuit identifier Each packet is forwarded based on the label in the packet Kyung Hee University 10 Connection-Oriented Packet Switched Network Each packet is forwarded through virtual path Legend 4 3 2 1 Packets Network Virtual circuit A connection-oriented packet-switched network R1 R2 4 3 2 1 Sender 4 R5 3 Network 2 1 4 3 2 1 4 3 2 1 R3 R4 Receiver Kyung Hee University 11 Setup Phase of Connection-Oriented Service Setup Phase A router creates an entry for virtual circuit A request packet carries the source and destination address An acknowledgement packet complete the entries in the switching tables Data Transfer Phase : the network-layer packets belonging to one message can be sent one after another Teardown Phase After sending all packets to destination, source sends a special packet called a teardown packet A destination responds with a confirmation packet All routers delete the corresponding entry from their tables Kyung Hee University 12 Forwarding Process in Connection-Oriented Network Forwarding decision is based on the label in the packet Routing Table Legend Incoming Outgoing SA: Source address Port Label Port Label DA: Destination address 1 L1 2 L2 L1, L2: Labels L1 SA DA Data L2 SA DA Data 1 2 3 4 Incoming Outgoing label label Kyung Hee University 13 Sending Request Packet in a Virtual-Circuit Network A to B Legend Incoming Outgoing A to B Request packet Port Label Port Label Network Virtual circuit 1 14 3 1 R2 R1 2 A to B 1 4 A 3 R5 Network 2 A to B 1 2 3 2 3 4 A to B A to B 3 1 4 R3 R4 B Incoming Outgoing Incoming Outgoing Port Label Port Label Port Label Port Label 1 66 3 1 22 4 A to B A to B Kyung Hee University 14 Setup Acknowledgment in a Virtual-Circuit Network A to B Legend Incoming Outgoing Acknowledge packet Label Label Network Port Port Virtual circuit 1 14 3 4 R1 R2 2 14 1 4 3 A R5 Network 3 66 66 2 1 2 2 3 1 22 77 3 1 4 R3 22 R4 77 B Incoming Outgoing Incoming Outgoing Port Label Port Label Port Label Port Label 1 66 3 1 22 4 A to B A to B Kyung Hee University 15 Flow of One Packet in an Established Virtual Circuit A to B Legend Incoming Outgoing A B Data Datagram Port Label Port Label Network 1 14 3 66 Virtual circuit R1 R2 2 14 A B Data 1 4 A 3 R5 Network 66 A B Data 1 2 2 3 22 A B Data 77 A B Data 3 1 4 R3 R4 Incoming Outgoing Incoming Outgoing Port Label Port Label Port Label Port Label 1 66 3 22 1 22 4 77 A to B A to B Kyung Hee University 16 Delay in a Connection-Oriented Network Source Destination 1 p u t e S 2 y 3 a Transmission l e time d l 4 a t o T 5 n 6 w o d r a 7 e T Time Time Time Time Kyung Hee University 17 4.4 Network Layer Services Connectionless services are the dominant service in today’s Internet Example : Alice, who working in a publishing company, Wonderful Publishing, needs to send a message to Bob, the manager of a flower shop, Just Flower, to inform him that the advertising brochure for the shop has been printed and is ready to be shipped Logical Addressing Identification provided in the network-layer through a uniform and global addressing mechanism Kyung Hee University 18 An Imaginary part of the Internet Legend Alice Wonderful Publishing Application layer Alice Transport layer Cable modem Network layer DSL modem Data link layer Physical layer Point-to-point WAN Cable Regional ISP R1 T3 BestNet R1 R2 To other ISPs SONET R3 National ISP SONET SONET R3 R4 To other ISPs I II III ATM R5 R5 SONET ServeNet R7 Just R6 Flowers T3 T3 R6 T3 R8 DSL Regional ISP Bob R8 Bob Kyung Hee University 19 Service Provided at the Source Computer Packetizing Encapsulate the data coming from the upper layer in a datagram Finding Logical Address of Next Hop Consult a routing table to find the logical address of the next hop Finding MAC Address of Next Hop Using ARP(Address Resolution Protocol) Fragmentation When the datagram is bigger then MTU(Maximum Transmission Unit) datagram needs to be fragmented to smaller units before being passed to the data link layer Kyung Hee University 20 Services Provided at the Source Computer Kyung Hee University 21 Services Provided at Each Router A router is involved with two interface (the incoming interface and the outgoing interface) Finding next-hop logical address Finding next-hop MAC address Fragmentation Kyung Hee University 22 Processing at Each Router Kyung Hee University 23 Services Provided at the Destination Computer Reassemble the fragment (Validating each datagram) Deliver the data to upper layer Set a reassembly timer, if the timer is expired, all data fragments are destroyed and an error message is sent that all the fragmented datagram need to be resent Kyung Hee University 24 Processing at the Destination Computer Kyung Hee University 25 4.5 Other Network Layer Issues Error Control Mechanism for detecting corrupted, lost or duplicate datagram Checksum, ICMP Flow Control Regulate the amount of data a source can send without overwhelming the receiver Congestion Control Congestion in the network layer is a situation in which too many datagrams are present in an area of the internet Choke protocol in connectionless network and ICMP Advanced negotiation during connection setup in connection-oriented network QoS (Quality of Service) For Multimedia communication(real-time communication of audio and video) Routing - How a router creates its routing table Security IPSec Kyung Hee University 26 Error Checking at the Data Link Layer The case of that there are some areas in the path of the datagram that some errors may occurs but never checked Kyung Hee University 27 Note No flow control is provided for the current version of Internet network layer Kyung Hee University 28 Summary(1) At the conceptual level. We can think of the global Internet as a black box network. The Internet, however, is not one single network; it is made of many networks (or links) connected together through the connecting devices. In this Internet, a connecting device such as a router acts as a switch.
Load more

Recommended publications
  • Remote Collaborative Real-Time Multimedia Experience Over The
    Remote C ollaborative Real-Time Multimedia Experience over the Future Internet ROMEO Grant Agreement Number: 287896 D4.2 Report on streaming/broadcast techniques for 3D multi-view video and spatial audio ROMEO WP4 Page 1/50 Document description Name of document Report on streaming/broadcast techniques for 3D multi-view video and spatial audio Abstract This document provides a detailed description of the packetization schemes in ROMEO and specifies high level syntax elements of the media formats in order to perform efficient transport and synchronization of the 3D audio and multiview video streams. Adaptation mechanisms and error concealment methods are also proposed in the context of degraded network conditions. Document identifier D4.2 Document class Deliverable Version 1.0 Author(s) N.Tizon, D. Nicholson (VITEC) H. Weigold, H. Ibl, J. Lauterjung (R&S) K. Birkos, A. Kordelas, A. Lykourgiotis, I. Politis (UPAT) Xiyu Shi (MulSys) M.Laabs (IRT) E. Ekmekcioglu (UNIS) A. Akman, S. O. Pelvan, S. Çiftçi, E. Çimen Öztürk (TTA) QAT team D. Doyen (TEC) F. Pascual Blanco (TID) H. Marques (IT) Date of creation 24-Jul-2012 Date of last modification 21-Dec-2012 Status Final Destination European Commission WP number WP4 Dissemination Level Public Deliverable Nature Report ROMEO WP4 Page 2/50 TABLE OF CONTENTS TABLE OF CONTENTS ............................................................................................................. 3 LIST OF FIGURES.....................................................................................................................
    [Show full text]
  • The Internet in Transition: the State of the Transition to Ipv6 in Today's
    Please cite this paper as: OECD (2014-04-03), “The Internet in Transition: The State of the Transition to IPv6 in Today's Internet and Measures to Support the Continued Use of IPv4”, OECD Digital Economy Papers, No. 234, OECD Publishing, Paris. http://dx.doi.org/10.1787/5jz5sq5d7cq2-en OECD Digital Economy Papers No. 234 The Internet in Transition: The State of the Transition to IPv6 in Today's Internet and Measures to Support the Continued Use of IPv4 OECD FOREWORD This report was presented to the OECD Working Party on Communication, Infrastructures and Services Policy (CISP) in June 2013. The Committee for Information, Computer and Communications Policy (ICCP) approved this report in December 2013 and recommended that it be made available to the general public. It was prepared by Geoff Huston, Chief Scientist at the Asia Pacific Network Information Centre (APNIC). The report is published on the responsibility of the Secretary-General of the OECD. Note to Delegations: This document is also available on OLIS under reference code: DSTI/ICCP/CISP(2012)8/FINAL © OECD 2014 THE INTERNET IN TRANSITION: THE STATE OF THE TRANSITION TO IPV6 IN TODAY'S INTERNET AND MEASURES TO SUPPORT THE CONTINUED USE OF IPV4 TABLE OF CONTENTS FOREWORD ................................................................................................................................................... 2 THE INTERNET IN TRANSITION: THE STATE OF THE TRANSITION TO IPV6 IN TODAY'S INTERNET AND MEASURES TO SUPPORT THE CONTINUED USE OF IPV4 .......................... 4
    [Show full text]
  • X.25: ITU-T Protocol for WAN Communications
    X.25: ITU-T Protocol for WAN Communications X.25, an ITU-T protocol for WAN communications, is a packet switched data network protocol which defines the exchange of data as well as control information between a user device, called Data Terminal Equipment (DTE) and a network node, called Data Circuit Terminating Equipment (DCE). X.25 is designed to operate effectively regardless of the type of systems connected to the network. X.25 is typically used in the packet-switched networks (PSNs) of common carriers, such as the telephone companies. Subscribers are charged based on their use of the network. X.25 utilizes a Connection-Oriented service which insures that packets are transmitted in order. X.25 sessions are established when one DTE device contacts another to request a communication session. The DTE device that receives the request can either accept or refuse the connection. If the request is accepted, the two systems begin full-duplex information transfer. Either DTE device can terminate the connection. After the session is terminated, any further communication requires the establishment of a new session. X.25 uses virtual circuits for packets communications. Both switched and permanent virtual circuits are used. X.75 is the signaling protocol for X.25, which defines the signaling system between two PDNs. X.75 is essentially an Network to Network Interface (NNI). X.25 protocol suite comes with three levels based on the first three layers of the OSI seven layers architecture. The Physical Level: describes the interface with the physical environment. There are three protocols in this group: 1) X.21 interface operates over eight interchange circuits; 2) X.21bis defines the analogue interface to allow access to the digital circuit switched network using an analogue circuit; 3) V.24 provides procedures which enable the DTE to operate over a leased analogue circuit connecting it to a packet switching node or concentrator.
    [Show full text]
  • Virtual-Circuit Networks: Frame Relay Andatm
    CHAPTER 18 Virtual-Circuit Networks: Frame Relay andATM In Chapter 8, we discussed switching techniques. We said that there are three types of switching: circuit switching, packet switching, and message switching. We also men­ tioned that packet switching can use two approaches: the virtual-circuit approach and the datagram approach. In this chapter, we show how the virtual-circuit approach can be used in wide-area networks. Two common WAN technologies use virtual-circuit switching. Frame Relay is a relatively high-speed protocol that can provide some services not available in other WAN technologies such as DSL, cable TV, and T lines. ATM, as a high-speed protocol, can be the superhighway of communication when it deploys physical layer carriers such as SONET. We first discuss Frame Relay. We then discuss ATM in greater detaiL Finally, we show how ATM technology, which was originally designed as a WAN technology, can also be used in LAN technology, ATM LANs. 18.1 FRAME RELAY Frame Relay is a virtual-circuit wide-area network that was designed in response to demands for a new type ofWAN in the late 1980s and early 1990s. 1. Prior to Frame Relay, some organizations were using a virtual-circuit switching network called X.25 that performed switching at the network layer. For example, the Internet, which needs wide-area networks to carry its packets from one place to another, used X.25. And X.25 is still being used by the Internet, but it is being replaced by other WANs. However, X.25 has several drawbacks: a.
    [Show full text]
  • Army Packet Radio Network Protocol Study
    FTD-RL29 742 ARMY PACKET RAHDIO NETWORK PROTOCOL STUDY(U) SRI / I INTERNATIONAL MENLO PARK CA D E RUBIN NOY 77 I SRI-TR-2325-i43-i DRHCi5-73-C-8i87 p UCLASSIFIED F/G 07/2. 1 L '44 .25I MICROCOPY RESOLUTION TFST CHART NAT ONAL BUREAU Cf STINDRES 1% l A I " S2 5 0 0 S _S S S ARMY PACKET RADIO NETWORK PROTOCOL STUDY CA Technical Report 2325-143-1 e November1977 By: Darryl E. Rubin Prepared for: U,S. Army Electronics Command Fort Monmouth, New Jersey 07703 Attn: Mi. Charles Graff, DRDCO-COM-RF-4 Contract DAHC 1 5-73-C-01 87 SRI Project 2325 * 0. The views and conclusions contained in this document are those of author and should not be Interpreted as necessarily representing th Cofficial policies, either expressed or implied, of the U.S. Army or the .LJ United States Government. -. *m 333 Ravenswood Ave. * Menlo Park, California 94025 0 (415) 326-6200 eCable: STANRES, Menlo Park * TWX: 910-373-1246 83 06 '03 . 4qUNCLASSIFIED SECURITY CLASSIFICATION OF THIS PAGE (When Data Entered) READ INSTRUCTIONS REPORT DOCUMENTATION PAGE BEFORE COMPLETING FORM 1 REPORT NUMBER 2. GOVT ACCESSION NO 3 RECIPIENT'S CATALOG NUMBER [" 2~~1325-143-1 / )r -. : i'/ - 4. TITLE Subtitle) 5-.and TYPE OF REPORT & PERIOD COVERED Army Packet Radio Network Protocol Study Technical Report 6. PERFORMING ORG. REPORT NUMBER 7 AUTHOR(s) A 8 CONTRACT OR GRANT NUMBER(s) Darrvl E. Rubin DAHCI5-73C-0187 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT, PROJECT. TASK AREA & WORK UNIT NUMBERS SRI International Program Code N.
    [Show full text]
  • Data Communications & Networks Session 1
    Data Communications & Networks Session 1 – Main Theme Introduction and Overview Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Adapted from course textbook resources Computer Networking: A Top-Down Approach, 5/E Copyright 1996-2009 J.F. Kurose and K.W. Ross, All Rights Reserved 1 Agenda 11 InstructorInstructor andand CourseCourse IntroductionIntroduction 22 IntroductionIntroduction andand OverviewOverview 33 SummarySummary andand ConclusionConclusion 2 Who am I? - Profile - 27 years of experience in the Information Technology Industry, including twelve years of experience working for leading IT consulting firms such as Computer Sciences Corporation PhD in Computer Science from University of Colorado at Boulder Past CEO and CTO Held senior management and technical leadership roles in many large IT Strategy and Modernization projects for fortune 500 corporations in the insurance, banking, investment banking, pharmaceutical, retail, and information management industries Contributed to several high-profile ARPA and NSF research projects Played an active role as a member of the OMG, ODMG, and X3H2 standards committees and as a Professor of Computer Science at Columbia initially and New York University since 1997 Proven record of delivering business solutions on time and on budget Original designer and developer of jcrew.com and the suite of products now known as IBM InfoSphere DataStage Creator of the Enterprise Architecture Management Framework (EAMF) and main
    [Show full text]
  • Multiprotocol Label Switching
    CHAPTER23 MULTIPROTOCOL LABEL SWITCHING 23.1 The Role of Mpls 23.2 Background Connection-Oriented QoS Support Traffic Engineering Virtual Private Network (VPN) Support Multiprotocol Support 23.3 MPLS Operation 23.4 Labels Label Stacking Label Format Label Placement 23.5 FECs, LSPs, and Labels Route Selection 23.6 Label Distribution Requirements for Label Distribution Label Distribution Protocol LDP Messages LDP Message Format 23.7 Traffic Engineering Elements of MPLS Traffic Engineering Constrained Shortest-Path First Algorithm RSVP-TE 23.8 Virtual Private Networks Layer 2 Virtual Private Network Layer 3 Virtual Private Network 23.9 Recommended Reading 23.10 Key Terms, Review Questions, and Problems 749 750 CHAPTER 23 / MULTIPROTOCOL LABEL SWITCHING LEARNING OBJECTIVES After studying this chapter, you should be able to: ◆ Discuss the role of MPLS in an Internet traffic management strategy. ◆ Explain at a top level how MPLS operates. ◆ Understand the use of labels in MPLS. ◆ Present an overview of how the function of label distribution works. ◆ Present an overview of MPLS traffic engineering. ◆ Understand the difference between layer 2 and layer 3 VPNs. In Chapter 19, we examined a number of IP-based mechanisms designed to improve the performance of IP-based networks and to provide different levels of quality of service (QoS) to different service users. Although the routing protocols discussed in Chapter 19 have as their fundamental purpose dynami- cally finding a route through an internet between any source and any destina- tion, they also provide support for performance goals in two ways: 1. Because these protocols are distributed and dynamic, they can react to congestion by altering routes to avoid pockets of heavy traffic.
    [Show full text]
  • Networking CS 3470, Section 1 Forwarding
    Chapter 3 Part 3 Switching and Bridging Networking CS 3470, Section 1 Forwarding A switching device’s primary job is to receive incoming packets on one of its links and to transmit them on some other link This function is referred as switching and forwarding According to OSI architecture this is the main function of the network layer Forwarding How does the switch decide which output port to place each packet on? It looks at the header of the packet for an identifier that it uses to make the decision Two common approaches Datagram or Connectionless approach Virtual circuit or Connection-oriented approach Forwarding Assumptions Each host has a globally unique address There is some way to identify the input and output ports of each switch We can use numbers We can use names Datagram / Connectionless Approach Key Idea Every packet contains enough information to enable any switch to decide how to get it to destination Every packet contains the complete destination address Datagram / Connectionless Approach An example network To decide how to forward a packet, a switch consults a forwarding table (sometimes called a routing table) Copyright © 2010, Elsevier Inc. All rights Reserved Datagram / Connectionless Approach Destination Port ----------------------------------- A 3 B 0 C 3 D 3 E 2 F 1 G 0 H 0 Forwarding Table for Switch 2 Copyright © 2010, Elsevier Inc. All rights Reserved Datagram Networks: The Internet Model No call setup at network layer Routers: no state about end-to-end connections no network-level concept of “connection” Packets forwarded using destination host address packets between same source-dest pair may take different paths session session transport transport network network 1.
    [Show full text]
  • Session 5: Data Link Control
    Data Communications & Networks Session 4 – Main Theme Data Link Control Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Adapted from course textbook resources Computer Networking: A Top-Down Approach, 6/E Copyright 1996-2013 J.F. Kurose and K.W. Ross, All Rights Reserved 1 Agenda 1 Session Overview 2 Data Link Control 3 Summary and Conclusion 2 What is the class about? .Course description and syllabus: »http://www.nyu.edu/classes/jcf/csci-ga.2262-001/ »http://cs.nyu.edu/courses/Fall13/CSCI-GA.2262- 001/index.html .Textbooks: » Computer Networking: A Top-Down Approach (6th Edition) James F. Kurose, Keith W. Ross Addison Wesley ISBN-10: 0132856204, ISBN-13: 978-0132856201, 6th Edition (02/24/12) 3 Course Overview . Computer Networks and the Internet . Application Layer . Fundamental Data Structures: queues, ring buffers, finite state machines . Data Encoding and Transmission . Local Area Networks and Data Link Control . Wireless Communications . Packet Switching . OSI and Internet Protocol Architecture . Congestion Control and Flow Control Methods . Internet Protocols (IP, ARP, UDP, TCP) . Network (packet) Routing Algorithms (OSPF, Distance Vector) . IP Multicast . Sockets 4 Course Approach . Introduction to Basic Networking Concepts (Network Stack) . Origins of Naming, Addressing, and Routing (TCP, IP, DNS) . Physical Communication Layer . MAC Layer (Ethernet, Bridging) . Routing Protocols (Link State, Distance Vector) . Internet Routing (BGP, OSPF, Programmable Routers) . TCP Basics (Reliable/Unreliable) . Congestion Control . QoS, Fair Queuing, and Queuing Theory . Network Services – Multicast and Unicast . Extensions to Internet Architecture (NATs, IPv6, Proxies) . Network Hardware and Software (How to Build Networks, Routers) . Overlay Networks and Services (How to Implement Network Services) .
    [Show full text]
  • Multihop Packet Radio Networks
    Congestion Control Using Saturation Feedback for Multihop Packet Radio Networks/ A Thesis Presented to The Faculty of the College of Engineering and Technology Ohio University In Partial Fulfillment of the Requirements for the Degree Master of Science by Donald E. Carter ,.,#'" Novem b er, 1991 Congestion Control Using Saturation Feedback for Multihop Packet Radio Networks DOIlald E. Carter November 19, 1991 Contents 1 The Packet Radio Network 1 1.1 Summary of Packet Radio Protocol 2 1.1.1 Spread Spectrum Transmission 2 1.1.2 Packet Acknowledgement Protocols 4 2 Flow Control to Minimize Congestion 7 2.1 Congestion Control Algorithrns 7 2.1.1 Preallocation of Buffers. 8 2.1.2 Packet Discarding. 8 2.1.3 Isarithmic Congestion Control . 9 2.1.4 Flow Control 9 2.1.5 Choke Packets. 10 2.2 The Adaptive Flow Control Algorithms. 10 2.2.1 Theoretical Limits 011 Throughput with Fixed Trans- mit Probability .................... .. 11 11 2.2.2 Adaptive Transmit Probability 11 2.2.3 Actual Network Throughput .. 12 2.2.4 Minimum Queue Length Routing 13 2.2.5 The Saturation Feedback Algorithm .. 13 2.2.6 Channel Access Protocol for Dedicated Channel Ac- knowledgemcnt with Saturation Feedback 18 3 The MHSS Simulation Model 20 3.1 Modifications to the MHSS Computer Code 21 3.1.1 Modifications to MHSSl.FOR . 21 3.1.2 Modifications to SCHEDULEl.F'OR 22 3.1.3 Modifications to SEND DATA.FOll . 22 3.1.4 Modifications to SEND A(jI{.!;'OR 23 3.1.5 Modifications to PROCj R.X.
    [Show full text]
  • Anomaly Detection in Iot Communication Network Based on Spectral Analysis and Hurst Exponent
    applied sciences Article Anomaly Detection in IoT Communication Network Based on Spectral Analysis and Hurst Exponent Paweł Dymora * and Mirosław Mazurek Faculty of Electrical and Computer Engineering, Rzeszów University of Technology, al. Powsta´nców Warszawy 12, 35-959 Rzeszów, Poland; [email protected] * Correspondence: [email protected] Received: 14 November 2019; Accepted: 3 December 2019; Published: 6 December 2019 Abstract: Internet traffic monitoring is a crucial task for the security and reliability of communication networks and Internet of Things (IoT) infrastructure. This description of the traffic statistics is used to detect traffic anomalies. Nowadays, intruders and cybercriminals use different techniques to bypass existing intrusion detection systems based on signature detection and anomalies. In order to more effectively detect new attacks, a model of anomaly detection using the Hurst exponent vector and the multifractal spectrum is proposed. It is shown that a multifractal analysis shows a sensitivity to any deviation of network traffic properties resulting from anomalies. Proposed traffic analysis methods can be ideal for protecting critical data and maintaining the continuity of internet services, including the IoT. Keywords: IoT; anomaly detection; Hurst exponent; multifractal spectrums; TCP/IP; computer network traffic; communication security; Industry 4.0 1. Introduction Network traffic modeling and analysis is a crucial issue to ensure the proper performance of the ICT system (Information and Communication Technologies), including the IoT (Internet of Things) and Industry 4.0. This concept defines the connection of many physical objects with each other and with internet resources via an extensive computer network. The IoT approach covers not only communication devices but also computers, telephones, tablets, and sensors used in the industry, transportation, etc.
    [Show full text]
  • An Overview & Analysis Comparision of Internet Protocal Tcp\Ip V/S Osi
    ISSN: 2278 – 1323 International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 1, Issue 7, September 2012 AN OVERVIEW & ANALYSIS COMPARISION OF INTERNET PROTOCAL TCP\IP V/S OSI REFRENCE MODAL 1 , Nitin Tiwari ,Rajdeep Singh solanki Gajaraj Singh pandya international standard, An ISO Cover all Abstract :-Basically network is a set number of aspects of network communication is the open interconnected lines presenting a net, and a system interconnection (OSI) model .an open network’s roads |an interlinked system, a system is a set of protocol that allow two network of alliances. Today, computer different system to communicate regardless of networks are the core of modern their underline architecture. it is a modal for communication. All modern aspects of the understanding the design of a network Public Switched Telephone Network (PSTN) architecture. are computer-controlled, and telephony keywords—TCP/IP, OSI REFRENCE MODAL,IP increasingly runs over the Internet Protocol, HEADER,ICMP. although not necessarily the public Internet. Introduction The scope of communication has increased enough in the past decade, and this boom in A LAN (local area network) is a network that communications would not have been feasible linked computers and devices in a limited without the progressively advancing computer geographical area such as home, school, network. Computer networks and the computer laboratory, office building, or closely technologies needed to connect and positioned group of buildings. Each computer communicate through and between them, or device on the network is a node. Current continue to drive computer hardware, software, wired LANs are most likely to be based on and peripherals industries.
    [Show full text]