Some Aspects of Propagation. Operators Are Not Functions Network operators rarely behave as functions - they can have multiple outputs a range can turn.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

AI Pathfinding Representing the Search Space
ECE 720T5 Fall 2011 Cyber-Physical Systems Rodolfo Pellizzoni.
Lecture 8: Asynchronous Network Algorithms
Token-Dased DMX Algorithms n LeLann’s token ring n Suzuki-Kasami’s broadcast n Raymond’s tree.
Routing in a Parallel Computer. A network of processors is represented by graph G=(V,E), where |V| = N. Each processor has unique ID between 1 and N.
Physical Structures Before discussing networks, we need to define some network attributes. Type of Connection 1- Point-to-Point 2- point-to-Multi point.
What is a network? A network consists of two or more computers that are linked in order to share resources (such as printers and CD-ROMs) , exchange.
Jaringan Komputer Lanjut Packet Switching Network.
Garbage Collecting the World. --Bernard Lang, Christian and Jose Presented by Shikha Khanna coen 317 Date – May25’ 2005.
Lecture 7: Synchronous Network Algorithms
Multiple Processor Systems
The Out of Kilter Algorithm in Introduction The out of kilter algorithm is an example of a primal-dual algorithm. It works on both the primal.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
From Words to Knowledge ORION Active Structure. ORION Active Structure Two Approaches We could separate the process of turning words into knowledge into.
1 Complexity of Network Synchronization Raeda Naamnieh.
Networks Types. Spring 2002Computer Network Applications Data Transfer During the ’70s: Minicomputers became affordable; Need to communicate information;
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 23 Introduction to Computer Networks.
Two Ways to Think About Connected Systems Architectures and Connections Architectures range from fully centralized to fully distributed. Centralized are.
Computer Network 實踐資管 Wang-Jiunn Cheng 2004 PART IV-1 Local Area Networks (LANs) Topology.
An Energy Efficient Leaser Election Algorithm for Mobile Ad Hoc Networks Paolo Cemim, Vinicius De Antoni Instituto de Informatica Universidade Federal.
Connecting LANs, Backbone Networks, and Virtual LANs
Switching Techniques Student: Blidaru Catalina Elena.
TRANSPORT LAYER T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
CSC 336 Data Communications and Networking Lecture 7d: Interconnecting LAN Dr. Cheer-Sun Yang Spring 2001.
Introduction Distributed Algorithms for Multi-Agent Networks Instructor: K. Sinan YILDIRIM.
1 LAN Technologies and Network Topology. 2 Direct Point-to-Point Communication.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Data Link Layer We have now discussed the prevalent shared channel technologies  Ethernet/IEEE  Wireless LANs (802.11) We have now covered chapters.
University of the Western Cape Chapter 12: The Transport Layer.
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
ECS 152A 4. Communications Techniques. Asynchronous and Synchronous Transmission Timing problems require a mechanism to synchronize the transmitter and.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 6 – Digital Data Communications Techniques.
Lecture 4: Sun: 23/4/1435 Distributed Operating Systems Lecturer/ Kawther Abas CS- 492 : Distributed system & Parallel Processing.
IST 126 Computer Networks Day 2. Server Security Only one password needed to access network Associated with the account is permission to access certain.
Computational Autonomy. Broadening the Focus Computational Autonomy is seen as a way of enlarging the narrow focus of a program, which carries out one.
Data Communications and Networking Overview
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Chapter 11 Extending LANs 1. Distance limitations of LANs 2. Connecting multiple LANs together 3. Repeaters 4. Bridges 5. Filtering frame 6. Bridged network.
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.
Tackling Exposed Node Problem in IEEE Mac Deepanshu Shukla ( ) Guide: Dr. Sridhar Iyer.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
SOLUTION EXAMPLE 1 Represent relations Consider the relation given by the ordered pair (–2, –3), (–1, 1), (1, 3), (2, –2), and (3, 1). a. Identify the.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
Understanding Network Architecture CHAPTER FOUR. The Function of Access Methods The set of rules that defines how a computer puts data onto the network.
Network Topologies Created by: Ghadeer H. Abosaeed June 22, 2012.
TOPICS INTRODUCTION CLASSIFICATION CHARACTERISTICS APPLICATION RELATED WORK PROBLEM STATEMENT OBJECTIVES PHASES.
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
Distributed Topology Control In Wireless Sensor Networks with Assymetric Links Presenter: Himali Saxena.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
Data and Computer Communications Eighth & Ninth Edition by William Stallings Chapter 6 – Digital Data Communications Techniques.
1 Chapter 11 Global Properties (Distributed Termination)
Goal: Identify and graph functions..  Relation: mapping or pairing, of input values with output values.  Domain: Set of input values.  Range: set of.
Physical Network Topology. When working with a network What is Physical Topology????? The physical topology of a network refers to the configuration of.
ECognition Model Components. 2. eCognition Model Components1 Model Components Variables and Constants Operators and Functions Links Logical States Messages.
1 UNIT 13 The World Wide Web. Introduction 2 The World Wide Web: ▫ Commonly referred to as WWW or the Web. ▫ Is a service on the Internet. It consists.
COMPUTER NETWORKS Lecture-8 Husnain Sherazi. Review Lecture 7  Shared Communication Channel  Locality of Reference Principle  LAN Topologies – Star.
Network types Point-to-Point (Direct) Connection Dedicated circuit boards connected by cable; To transfer data from A to B: – A writes on its circuit board;
Advanced Computer Networks
1.6 Represent Functions as Rules and Tables
Distributed Snapshot Distributed Systems.
Formalizing Relations and Functions
Presentation transcript:

Some Aspects of Propagation

Operators Are Not Functions Network operators rarely behave as functions - they can have multiple outputs a range can turn into a domain some operator pairs cooperate topology is altered direction is locally determined they can destroy themselves

Multiple Simultaneous Outputs AND The SPINE operator behaves as an AND, so setting an environment can communicate a state to thousands of statements

Range to Domain ABS -5 5 ABS -5,5 5 Some operators reverse the operation of functions

Turning It Around + Some operators receive a message, and immediately send a consistent reduced message back along the same path

Operator Cooperation Some operator pairs cooperate strongly - FOR/GETPUT ACTIVITY/RESOURCE DISTRIB/RELATION Some of these use spreading activation rather than message passing

X=5 =+ List Link = B=9 C=3A% D List Link Altering Connections The LISTLINK operator alters the topology of the network

X =+ B C D B=9 C=3 X=5 D=-7 + Flow on Connection The LISTLINK detaches itself and links the variables directly to the PLUS, at which point information flows in whichever direction the arrows indicate List Link A% List Link

Creative Destruction Operators can represent objects, which are created and destroyed

Phasing of operations in a network can be a considerable problem, because of the network’s unpredictable transmission delays. This problem is exacerbated when a single processor is emulating a network of autonomous cells or agents. One way around this is to add connections - to change the topology.

Alternative Tags The initial tag values arrive at the operator - there are two alternatives on the right hand side PARSE Article Noun/ Verb “The” “quake”

Alternative Tags The verb tag alternative is pruned, as the verb could not be preceded by an article. There is now a possibility to detect a noun phrase, which requires that all the nodes to be checked have singular values. But how long before the new value reaches the node? PARSE Article Noun/ Verb “The” “quake”

Alternative Tags Forming a new connection to the node at the same time as propagating the value in the link guarantees the value has reached the node before the operator triggers the search for a noun phrase. PARSE Article Noun/ Verb “The” “quake”

Alternative Tags The state from the node triggers the operator to search for a noun phrase. PARSE Article Noun/ Verb “The” “quake”

Throwing a Connection Instead of using a timer, we can create a connection to tell us exactly when we can restart Problem: We have been prompted to search, but one connection is not ready - how do we restart when it is ready Solution: Make a connection, wait for the change of state to tell us it is ready - use the connection paradigm and extend it

Back Connections Forming back-connections is a powerful way of phasing operations in a network - whether in a computer or in a person’s head

Why a Structure? The activity in the structure, and its continual self-modification, would make the life of any outside algorithm very difficult IF A > 5 THEN BEGIN IF B = 3 THEN BEGIN PROC_C