Doc.: IEEE 802.11-08/0636r0 Submission April 2008 L. Chu Etc.Slide 1 Symmetrical Airtime Link Metric Report and Path Loop Avoidance Date: 2008-04-28 Authors:

Slides:



Advertisements
Similar presentations
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Advertisements

Doc.: IEEE /0578r0 Submission 2008 May Jarkko Kneckt, NokiaSlide 1 Forwarding in mesh containing MPs in power save Date: Authors:
Doc.: IEEE /2555r0 Submission September 2007 Guenael Strutt, MotorolaSlide 1 Mesh points that do not forward Date: Authors:
Doc.: IEEE /0798r1 Submission July 2008 L. Chu Etc.Slide 1 HT Features in Mesh Network Date: Authors:
Doc.: IEEE /1267r0 Submission November 2008 L. Chu Etc.Slide 1 Multiple Radio MP Date: Authors:
Doc.: IEEE /2439r0 Submission September 2007 L.Chu Etc.Slide 1 Forwarding at Intermediate and Destination Mesh Points (MP) using 6-Address Scheme.
Doc.: IEEE /0846r0 Submission July 2008 Mathilde BenvenisteSlide 1 Power save for wireless mesh Mathilde Benveniste
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
Doc.: IEEE /1996r2 Submission June 2007 Kazuyuki SakodaSlide 1 Power save and Routing Date: Authors:
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Doc.: IEEE /1468r0 Submission Dec 2008 Ashish Shukla, Marvell SemiconductorSlide 1 ERP Protection in IEEE s Mesh Network Date:
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Doc.: IEEE /0103r0 Submission January 2008 Jarkko Kneckt, NokiaSlide 1 Peer Service Period Date: Authors:
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
Doc.: IEEE /0650r0 Submission May 2007 Michael Souryal, NISTSlide 1 Mechanism for Link Quality Measurement Notice: This document has been prepared.
Doc.: IEEE /1234r0 Submission October 2008 L. Chu Etc.Slide s Power Saving Issues Date: Authors:
Doc.: IEEE Submission May 2014, Slide 1 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Response.
Doc.: IEEE /0562r0 Submission May 2009 L. Chu et alSlide 1 MCF Issues Date: Authors:
Doc.: IEEE /0278r5 Submission March 2008 Javier Cardona et al. Avoiding Interactions with Lazy-WDS Equipment Date:
Doc.: IEEE /0635r2 Submission July 2008 L. Chu Etc.Slide 1 MDA Issues Date: Authors:
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
Doc.: IEEE /0624r2 SubmissionLiwen Chu Etc.Slide 1 Scheduled Medium Access For Large Low Power BSS Date: Authors: Date: May, 2012.
Loop-Free Updates of Forwarding Tables Author : Jing Fu, Peter Sjödin and Gunnar Karlsson Publisher : IEEE Transactions on Network and Service Management.
Doc.: IEEE /1468r1 Submission Jan 09 Ashish Shukla, Marvell SemiconductorSlide 1 ERP Protection in IEEE s Mesh Network Date:
Doc.: IEEE /0849r0 Submission July 2008 Sandesh Goel, Marvell et alSlide 1 Mesh QoS: Multiple Simultaneous Routes Authors:
Doc.: IEEE /1147r1 Submission November 2009 David Halasz, AclaraSlide 1 Path Protection Date: Authors:
Max do Val Machado Raquel A. F. Mini Antonio A. F. Loureiro DCC/UFMG DCC/PUC Minas DCC/UFMG IEEE ICC 2009 proceedings Advisor : Han-Chieh Chao Student.
Doc.: IEEE /2200r2 Submission July 2007 Sandesh Goel, Marvell et alSlide 1 Route Metric Proposal Date: Authors:
Doc.: IEEE /1893r0 Submission December 2006 Marc Mosko, PARCSlide 1 [HWMP Routing Loops] Notice: This document has been prepared to assist IEEE.
Doc.: IEEE /0619r0 Submission May 2008 M. Benveniste (Avaya Labs) Scheduled service periods in wireless mesh Notice: This document has been prepared.
Doc.: IEEE /0174r2 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Date: Authors: Notice: This document.
Doc.: IEEE /2952r2 Submission Dec 2007 L.Chu Etc.Slide 1 Simplified DLS Action Frame Transmission in 11Z Date: Authors:
Submission doc.: IEEE /838r0 July 2016 Guido R. Hiertz, EricssonSlide 1 Resolution to CID 8291 Date: Authors:
Relationship between peer link and physical link
Route Metric Proposal Date: Authors: July 2007 Month Year
A comparison of Ad-Hoc Routing Protocols
Path Selection and Power Save
Link Metric for High Throughput Mesh
1-PREQ : n-Targets versus n-PREQ : 1-Target
Symmetrical Airtime Link Metric Report and Path Loop Avoidance
Symmetrical Airtime Link Metric Report and Path Loop Avoidance
<month year> doc.: IEEE July 2005
Link Metric for High Throughput Mesh
Thoughts on Interaction between Power Management and Path Selection
Fix inconsistency in PLM specification
Proposed Resolutions to RFI comments of LB 166 on IEEE s D7.0
PREQ/PREP Create/Process/Forward
PREQ/PREP Create/Process/Forward
PREQ/PREP Create/Process/Forward
PREQ/PREP Create/Process/Forward
End-to-End Aware Association in Mesh Networks: Performance Study
HT Features in Mesh Network
LB93 Unresolved RFI Comments
Common Mesh TSF Issues Date: Authors: September 2007
End-to-End Aware Association in Mesh Networks: Performance Study
Route Metric Proposal Date: Authors: July 2007 Month Year
Vinay Singh Graduate school of Software Dongseo University
Remedy for beacon bloat
Relationship between peer link and physical link
DSDV Destination-Sequenced Distance-Vector Routing Protocol
Power Aware Link Metric
Proposed Change to Intra-Mesh Congestion Notification Frame
Thoughts on Interaction between Power Management and Path Selection
September 2006 doc.: IEEE /1351r0 September 2006
PREQ/PREP Create/Process/Forward
Presentation transcript:

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 1 Symmetrical Airtime Link Metric Report and Path Loop Avoidance Date: Authors:

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 2 Abstract The current s airtime link metric does not include a power saving factor which may give a power saving MP the same chance to become a forwarding node. This may increase end-to-end delay. The current airtime link report mechanism can not guarantee symmetrical airtime link metrics in peer link MPs which may create more unstable forwarding path and path loop. This presentation gives some solutions to these questions.

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 3 Issue: Airtime Link Metric The power saving feature is not considered in calculating airtime link metric –A forwarding power saving MP has the same chance to be selected as a forwarding MP This causes a power consumption problem for power saving MPs. This also causes problems with maintaining end-to-end QOS. O: varies depending on PHYB t : 8192 bitse f : frame error rate Equation in Draft:

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 4 Solution: Airtime Link Metric with Power Saving factor If a MP is a forwarding power saving MP, BI is the mesh beacon interval. If a MP is a normal MP, BI is zero. The BI term makes it less likely that a forwarding power saving MP to be selected as a forwarding node. Proposed Equation:

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 5 Current Link Metric Report If a bi-directional link metric is required, a MP may report new link metric to its neighbor peer MPs. If a bi-directional link metric is required, a MP may request the link metric from its neighbor peer MPs. A MP may update its link metric information factoring in the link metric information received. All these “may” operations can create asymmetric link metrics between two peer neighbor MPs, which leads to an routing instability, path-loops, etc.

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 6 Different Forward/Reverse Paths with Unequal Peer Link Metrics First source MP1 try to set up a path to destination MP5 (Suppose all MPs receives broadcast PREQ correctly): –MP1  MP5: MP1->MP2->MP4->MP5. –MP5  MP1: MP5->MP4->MP2->MP1. Then source MP6 try to set up a path to destination MP1 (Suppose all MPs receives broadcast PREQ correctly): –MP6  MP1: MP6->MP4->MP3->MP1. –MP1  MP6: MP1->MP3->MP4->MP6. Now the path from MP1 to MP5 and path from MP5 to MP1 become: –MP1  MP5: MP1->MP2->MP4->MP5. –MP5  MP1: MP5->MP4- >MP3->MP1. Each time MP1 or MP6 starts a route maintenance, there will be a path vibration! MP2 MP1MP4 MP3 Mesh Network MP5 MP x MPi MPj Link Metric from MPi to MPj

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 7 Improved Link Metric Report If bi-directional link metric is required, a MP shall report a new link metric to its neighbor peer MPs each time a different link metric is calculated. If a bi-directional link metric is required, a MP may request a link metric from its neighbor peer MPs. A MP shall update its link metric information using the link metric information received. –A possible link metric updating between MP1 and MP2 is (MP1 metric + MP2 metric)/2.

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 8 Path Loop with Asymmetrical Peer Link Metrics MP1 sends PREQ to MP6. Then MP5 sends PREQ (DO=0) to MP1. MP4 FIB DSTNHPDSN Metric MP1MP311 MP5 12 MP2 MP1MP4 MP3 MP MP2 MP1MP4 MP3 MP MP4 FIB DSTNHPDSN Metric MP1MP311 MP5 12 MP6 12 DST: Destination NHP: Next Hop DSN: DST Sequence Number FIB: Forward Information Table MP1 FIB DSTNHPDSN Metric MP6MP316 MP5’s PREQ PREP MP1’s PREQ MP MP3 FIB DSTNHPDSN Metric MP6MP414 MP1 11 MP3 FIB DSTNHPDSN Metric MP1 11

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 9 Path Loop with Asymmetrical Peer Link Metrics (Cont’d) MP1 sends PREP to MP5 since it has an effective path to MP6. MP4 will accept the PREP because PREP.DSN==DSN in FIB. Path loop for MP6 occurs! –MP4  MP2  MP1  MP3  MP4 MP2 MP1MP4 MP3 MP MP4 FIB DSTNHPDSN Metric MP1MP3 11 MP5 12 MP6MP2 110 PREQ PREP DST: Destination NHP: Next Hop DSN: DST Sequence Number FIB: Forward Information Table MP2 MP1MP4 MP3 MP5 MP MP1 FIB DSTNHPDSN Metric MP6MP316 MP5MP213 MP2 FIB DSTNHPDSN Metric MP5MP412 MP6MP118 2 MP6 2 2

doc.: IEEE /0636r0 Submission April 2008 L. Chu Etc.Slide 10 Path Loop Avoidance Methods Solution 1: Disable PREQ with DO being set to 0. Solution 2: Create a new PREP based on FIB information when PREP[DST].DSN equals to FIB[DST].DSN and PREP[DST].metric is larger than FIB[DST].metric: –Sets PREP[DST].metric to FIB[DST].metric, –Sets PREP[DST].hop to FIB[DST].hop, –Sets PREP[DST].lifetime to FIB[DST].lifetime. Solution 3: Discard received PREP when PREP[DST].DSN equals to FIB[DST].DSN && PREP[DST].metric is larger than FIB[DST].metric.