1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)

Slides:



Advertisements
Similar presentations
COMPUTER NETWORK TOPOLOGIES
Advertisements

EIGRP Explanation & Configuration By Bill Reed. We Will Examine the features of EIGRP Discuss why EIGRP is known as a Hybrid Routing Protocol Identify.
Multi-Layer Switching Layers 1, 2, and 3. Cisco Hierarchical Model Access Layer –Workgroup –Access layer aggregation and L3/L4 services Distribution Layer.
Routing Protocol.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
Routing and Routing Protocols
Routing.
1 Attribute Based Communications University of California, Irvine Presented By : Ala Khalifeh (Note: Presented)
Chapter 2 Network Models.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Virtual LANs. VLAN introduction VLANs logically segment switched networks based on the functions, project teams, or applications of the organization regardless.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Link-State and Balanced Hybrid Routing.
Network Topologies.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
Open Shortest Path First (OSPF) -Sheela Anand -Kalyani Ravi -Saroja Gadde.
Routing and Routing Protocols Dynamic Routing Overview.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
University of the Western Cape Chapter 11: Routing Aleksandar Radovanovic.
Packet-Switching Networks Routing in Packet Networks.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Connectivity Devices Hakim S. ADICHE, MSc
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
The OSI Model.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
© 1999, Cisco Systems, Inc. Module 9: Understanding Virtual LANs.
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Routing and Routing Protocols
Cisco Systems Networking Academy S2 C 11 Routing Basics.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
STORE AND FORWARD & CUT THROUGH FORWARD Switches can use different forwarding techniques— two of these are store-and-forward switching and cut-through.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Open Shortest Path First (OSPF)
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
1 Version 3.1 Module 6 Routed & Routing Protocols.
ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
© 2002, Cisco Systems, Inc. All rights reserved..
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
© 2002, Cisco Systems, Inc. All rights reserved..
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Sem 2 v2 Chapter 12: Routing. Routers can be configured to use one or more IP routing protocols. Two of these IP routing protocols are RIP and IGRP. After.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Communication Costs in Parallel Machines Dr. Xiao Qin Auburn University
Routing and Routing Protocols CCNA 2 v3 – Module 6.
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.
Working at a Small-to-Medium Business or ISP – Chapter 6
© 2002, Cisco Systems, Inc. All rights reserved.
Routing.
Link-State Routing Protocols
Dynamic Routing and OSPF
Network Topologies Charles Warren.
Link-State Routing Protocols
Chapter 3 Part 3 Switching and Bridging
Working at a Small-to-Medium Business or ISP – Chapter 6
Routing.
Presentation transcript:

1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)

2 APPN: Advanced Peer-to-Peer Networking This survey done by  Ala’ Khalifeh- Overview  Link g4/nd2006.htm# g4/nd2006.htm# / /  Application/Issue A Peer to Peer architecture proposed by IBM as an improvement to the SNA architecture.

3 Overview SNA (Systems Network Architecture) is one of the most popular network architecture models, proposed by IBM. SNA was designed around the host-to-terminal communication model that IBM's mainframes use. IBM expanded the SNA protocol to support peer-to-peer networking. This expansion was deemed Advanced Peer-to-Peer Networking (APPN) and Advanced Program-to-Program Communication (APPC). Advanced Peer-to-Peer Networking (APPN) represents IBM's second-generation SNA. In creating APPN. IBM moved SNA from a hierarchical, mainframe-centric environment to a peer-to-peer (P2P) networking environment.

4 Overview (Continued) Cisco’s IBM Internetworking Strategy  Cisco is the industry leader in the integration of IBM SNA networks within the framework of today’s expanding multiprotocol global internetworks. In 1993, Cisco held over 67 percent of the SNA router market, according to an IDC study. Cisco Implementation of APPN  Cisco licensed the APPN source code from IBM and then ported it to the Cisco IOS software using network services from the data-link controls (DLCs).

5 Overview (Continued) Cisco Implementation of APPN  Cisco licensed the APPN source code from IBM and then ported it to the Cisco IOS software using network services from the data-link controls (DLCs).

6 APPN Features APPN features include: Better distributed network control; because the organization is peer- to-peer rather than solely hierarchical, failed nodes can be isolated. Dynamic peer-to-peer exchange of information about network topology, which enables easier connections, reconfigurations, and routing. Dynamic definition of available network resources Automation of resource registration and directory lookup Flexibility, which allows APPN to be used in any type of network topology

7 Network Architecture An APPN network is composed of three types of APPN node:  Low Entry Networking (LEN) Node – The End user peripheral  End Node- An End Node is similar to a LEN node in that it participates at the periphery of an APPN network. An End Node includes a Control Point (CP) for network control information exchange with an adjacent network node.  Network Node - The backbone of an APPN network is composed of one or more Network Nodes which provide network services to attached LEN and End Nodes.

8 Network Architecture (Continued)

9 Session Initialization In order for an APPN session to be established, the following must occur: 1. The end user requests a session with an application, which causes the end node to begin the process of session establishment by sending a LOCATE message to its network node server. For session initiation, the network node server provides the path to the destination end node, which allows the originating end node to send messages directly to the destination.

10 Session Initialization (Continued) 2. The network node uses directory services to locate the destination by first checking its internal directories.  If the destination is not included in the internal directory, the network node sends a LOCATE request to the central directory server if one is available.  If a central directory server is not available, the network node sends a LOCATE broadcast to the adjacent network nodes that in turn propagate the LOCATE throughout the network.  The network node server of the destination returns a reply that indicates the location of the destination.

11 Session Initialization (Continued) 3. Based on the location of the destination, the network node server of the originator selects the least expensive path that provides the appropriate level of service. 4. The originating network node server sends a LOCATE reply to the originating end node. The LOCATE reply provides the path to the destination.

12 Session Initialization (Continued) 5. The originating end node is then responsible for initiating the session. A BIND is sent from the originating end node to the destination end node, requesting a session. After the destination replies to the BIND, session traffic can flow.

13 Routing Session connectors are used in place of routing tables in APPN. The unique session identifier and port from one side of the node are mapped to the unique session identifier and port on the other side. As data traffic passes through the node, the unique session identifier in the header is swapped for the outgoing identifier and sent out on the appropriate port, as shown in FigureFigure

14 Routing (Continued)

15 Topology Management Bootstrapping  APPN is a link-state protocol. Like other link- state-based algorithms, it maintains a database of the entire topology information of the network.  Every APPN network node in the network sends out TDU (Topology Database Update) packets that describe the current state of all its links to its adjacent network nodes.

16 Topology Management (Continued) The TDU contains information that identifies the following:  The characteristics of the sending node  The node and link characteristics of the various resources in the network  The sequence number of the most recent update for each described resource. A network node that receives a TDU packet propagates this information to its adjacent network nodes using a flow reduction technique

17 Topology Management (Continued) APPN network node maintains full knowledge of the network and how the network is interconnected. Once a network node detects a change to the network (either a change to the link, or the node), it floods TDUs throughout the network to ensure rapid convergence. If there is an unstable link in the network, it can potentially cause many TDU flows in a network. As the number of network nodes and links increases, so does the number of TDU flows in the network. This type of distributing topology can consume significant CPU cycles, memory, and bandwidth. Maintaining routes and a large, complete topology subnet can require a significant amount of dynamic memory.

18 Categorization-1 Yes Download Yes Centralized Hybrid yes YesDecentralized SearchStorageTopologyInitialization Functional Criteria The degree of decentralization

19 Categorization-2 Download Yes Structured Loosely structured Yes Unstructured SearchStorageTopologyInitialization Functional Criteria The degree of structure

20 Categorization-3 Download Security full redund ancy Reliability Scalability Uses topology database updates (TDUs) Adaptability Uses LOCATE search requests. Efficiency SearchStorageTopologyInitialization Functional Criteria Requirements