国外计算机类优秀博士答辩defensett教程.pptVIP

V. Ramachandran — Ph.D. Dissertation Defense * April 20, 2005 Proof Method Given a protocol oscillation, choose a path whose first node is the last oscillating node on the path. Follow the oscillation until the selection changes; this change occurred because of a linear or nonlinear selection. This corresponds to some relation between two paths; repeat with the ‘related’ path. Choose a subpath to find the last oscillating node. Because the oscillation is finite, we must re-visit a path.We have just traced a cycle in the dispute digraph. Cycle in MED-EVIL protocol-selection states. V. Ramachandran — Ph.D. Dissertation Defense * April 20, 2005 Protocol-Design Applications Multiple-Path Broadcast [B+ ’02] and [MC ’04] propose changing BGP to broadcast additional routes to avoid MED-induced oscillations. We can prove the effect of this behavior using ourformal model. Improvement: Detect an IRR violation on-the-fly and request the needed route. “Compare-all-MEDs” and “Set AS-distinct local preferences” [MGWR ’02] can be proven correct. V. Ramachandran — Ph.D. Dissertation Defense * April 20, 2005 Summary The PVPS framework allows for a study of path-vector-protocol design—most importantly, a rigorous way to prove: what balance of local and global constraints areneeded for robustness; and what else is lost when these constraints are implemented. The framework has provided concrete and reasonable guidelines for class-based systems. The framework has been extended to include protocols with IRR-violating selection procedures. V. Ramachandran — Ph.D. Dissertation Defense * April 20, 2005 Open Questions Analogous local constraints for the generalized case Real, deployable policy-configuration languages More examples of exact trade-offs between local and global constraints (to date, only class-based systems give this) Full characterization of robust systems? V. Ramachandran — Ph.D. Dissertation Defense V. Ramachandran — Ph.D. Dissertation Defense V. Ramachandran — Ph.D. D