EACP REQUIREMENTS draft-retana-rtgwg-eacp. Goal Catalogue proposed solutions to reduce power Ways in which to save energy, rather than algorithms designed.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Delivery and Forwarding of
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
Ver 1,12/09/2012Kode :CIJ 340,Jaringan Komputer Lanjut FASILKOM Routing Protocols and Concepts – Chapter 2 Static Routing CCNA.
1 Routing Techniques in Wireless Sensor networks: A Survey.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Static Routing Routing Protocols and Concepts – Chapter 2.
What is Flow Control ? Flow Control determines how a network resources, such as channel bandwidth, buffer capacity and control state are allocated to packet.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 Complexity of Network Synchronization Raeda Naamnieh.
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
© 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.
The OSI Model and the TCP/IP Protocol Suite
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
2015/7/2Deadlock-free Packet Switching1 Introduction to Distributed Algorithm Part One: Protocols Chapter 5- Deadlock-free Packet Switching Teacher: Chun-Yuan.
Delivery, Forwarding, and Routing
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
Readying Data Networks for Converged Services Presented by: Jaye Armstrong-CCIE Director of Data Services.
Introduction to networking (Yarnfield) Introduction to routing.
Authors: Joaquim Azevedo, Filipe Santos, Maurício Rodrigues, and Luís Aguiar Form : IET Wireless Sensor Systems Speaker: Hao-Wei Lu sleeping zigbee networks.
Network Topologies.
Introduction to networking (Yarnfield) Introduction to routing.
Network Design Essentials. Guide to Networking Essentials, Fifth Edition2 Contents 1. Examining the Basics of a Network Layout 2. Understanding Standard.
Chapter 2 Network Design Essentials Instructor: Nhan Nguyen Phuong.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 3: Routing Dynamically Routing Protocols Assist. Prof. Pongpisit.
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
Section 4 : The OSI Network Layer CSIS 479R Fall 1999 “Network +” George D. Hickman, CNI, CNE.
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
Click to edit Master subtitle style
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Routing and Routing Protocols
Chapter 11 Extending LANs 1. Distance limitations of LANs 2. Connecting multiple LANs together 3. Repeaters 4. Bridges 5. Filtering frame 6. Bridged network.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
UCLA ENGINEERING Computer Science RobustGeo: a Disruption-Tolerant Geo-routing Protocol Ruolin Fan, Yu-Ting Yu *, Mario Gerla UCLA, Los Angeles, CA, USA.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
IEEE 802.X Standards The Institute of Electrical and Electronics Engineers (IEEE) has developed a series of networking standards to ensure that networking.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 CH. 8: SWITCHING & DATAGRAM NETWORKS 7.1.
Describe basic routing concepts. Routers Interconnect Networks Router is responsible for forwarding packets from network to network, from the original.
Communication Chapter 2.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
Static Routing Routing Protocols and Concepts – Chapter 2.
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Instructor Materials Chapter 5: Dynamic Routing
Link-State Routing Protocols
Surviving Holes and Barriers in Geographic Data Reporting for
Introduction to Networking
Chapter 5: Dynamic Routing
Chapter 3: Dynamic Routing
ECE 544 Protocol Design Project 2016
(How the routers’ tables are filled in)
ECE 544 Protocol Design Project 2016
Routing Protocols and Concepts – Chapter 2
Link-State Routing Protocols
Delivery and Forwarding of
Data Communication Networks
Link-State Routing Protocols
DSDV Destination-Sequenced Distance-Vector Routing Protocol
WJEC GCSE Computer Science
Achieving Resilient Routing in the Internet
Presentation transcript:

EACP REQUIREMENTS draft-retana-rtgwg-eacp

Goal Catalogue proposed solutions to reduce power Ways in which to save energy, rather than algorithms designed to take advantage of those mechanisms Shut down links, shut down line cards, sleeps, microsleeps, etc. Examine possible problems caused by these various mechanisms Catalogue issues proposals in this space need to address Go between the algorithms and the techniques If you’re going to propose a system that uses microsleeps, then you need to consider…

Organization Introduction Describes the problem Describes business and application drivers Framework Catalogues methods of reducing energy usage that have been proposed in the past Discusses local verses global control Requirements Discusses one issue at a time Gives requirements to protocol designers to consider

Requirements Energy Efficiency and Bandwidth Cutting out links or devices reduces the aggregate bandwidth through the network Energy Efficiency and Stretch Reducing the size of the topology always increases stretch for at least some source/destination pairs Energy Efficiency and Fast Recovery To be renamed “Energy Efficiency and Resilience” Introducing Jitter through Microsleeps Discusses the relationship between sleep states and jitter Need to add… Something on packet loss to compliment the sections considering quality of service

Requirements (Example) In the network illustrated, if a modification is made to the control plane in order to remove the link between R1 and R4 in order to save energy, all the destinations shown in the diagram remain reachable. However, from the perspective of R1, the best path available to reach R2 has increased in length by two hops. The original path is R1->R2, the new path is R1->R3->R4->R2. This represents a stretch of 2. …. Designers who propose modifications to control plane protocols to achieve network energy efficiency SHOULD analyze the impact of their mechanisms on the stretch in typical network topologies, and SHOULD include such analysis when explaining the applicability of their proposals. /---R2---\ /---\ R1 R4 R5 \---R3---/ \---/

Requirements (Example) Such schemes introduce delay and jitter into the network path directly; if a packet arrives while the link to the next hop, or the next hop itself, is in a reduced energy state, the packet must wait until the link or next hop device enter a normal operational mode before it can be forwarded. Most of the time the proposed sleep states are so small as to be presumably inconsequential on overall packet delay, but multiple packets crossing a series of links, each encountering different links in different states, could take very different amounts of time to pass along the path. … Protocol designers SHOULD analyze the impact of accumulated jitter when proposing mechanisms that rely on microsleeps in either equipment or links. This analysis SHOULD include both worst case and best case scenarios, as well as an analysis of how coordinated clocks are to be handled in the case of coordinated sleep states. /---R2---\ /---\ R1 R4 R5 \---R3---/ \---/

Next Steps Review and add to fill in where needed Bring this on board as a working group document