DOCSLIB.ORG

Local Error Recovery in SRM : Comparison of Two Approaches

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Local Error Recovery in SRM : Comparison of Two Approaches Lo cal Error Recovery in SRM Comparison of Two Approaches ChingGung Liu Deb orah Estrin Scott Shenker and Lixia Zhang Memb ers use propagation delays to schedule their request Abstr act SRM is a framework for reliable multicast de livery In order to maximize the collab oration among the and reply timers each memb er detecting a loss waits for a group memb ers in error recovery b oth retransmission re random time p erio d b efore sending the retransmission re quests and replies are multicast to the entire group While quest and similarly each memb er receiving a retransmis SRM eectively uses random timers to suppress duplicate requests and replies the global nature of the request and sion request waits for a random time p erio d b efore sending replies means that every packet loss results in at least one the reply When memb ers receive a retransmission re request and reply message sent to the entire group quest or resp ectively a reply message while waiting to To further improve the scalability of SRM one must lo calize the scop e of error recovery trac In this pap er we send one of their own they cancel their scheduled trans present two approaches to lo cal recovery hopbased scop e mission This enables SRM to suppress duplicate requests control and use of lo cal recovery groups The rst approach and replies and thus avoid the request and reply message uses hop count to limit the distribution of requests and replies whereas the second approach connes error recov implosion problem ery trac using separatelyaddressed lo cal recovery groups However each packet loss will result in at least one re The lo cal recovery groups and hop count settings are au quest and one reply message b eing sent to the entire mul tomatically created and dynamically adjusted based on ob served loss patterns We use simulation exp eriments to ex ticast group This limits the scalability of SRM as network amine the p erformance of b oth approaches and group size increases As suggested in the premise of this pap er is that the error recovery mechanism should isolate error recovery trac to the required scop e Intro duction In this pap er we present two dierent mechanisms to lo calize the scop e of error recovery trac The hopscop ed Scalable Reliable Multicast SRM is a framework error recovery mechanism uses hop count to limit the dis for reliable multicast delivery it guarantees data deliv tance that request and reply messages can travel In con ery to all memb ers in a multicast session The mecha trast the groupscop ed error recovery mechanism connes nisms needed to achieve this reliability can b e decomp osed the propagation of error recovery trac by distributing it into two parts session message exchange and receiver to subsets of the group using separate multicast addresses initiated error recovery Memb ers p erio dically exchange Simulation results of these mechanisms suggest that they session messages to rep ort current group state eg the b oth reduce error recovery trac without intro ducing sig highest received sequence numb er from each source so that nicant overhead losses can b e detected and to determine the propagation Note that lo cal recovery is a p erformance optimization delays b etween each pair of memb ers The error re thus the mechanisms do not have to achieve the optimal or covery mechanism is receiverinitiated and NAKbased precise degree of lo cality the more lo cal the recovery the receivers are resp onsible for detecting data losses and re less recovery trac overhead there is In b oth mechanisms questing retransmissions These retransmission requests that we prop ose here a memb er may o ccasionally send and the resulting replies are multicast to the entire group its requests and replies to an inappropriate scop e While such mistakes have a slight impact on the p erformance ChingGung Liu is with the Fujitsu Lab oratories of America Inc e mail charleyafujitsucom of SRM in terms of the volume of error recovery trac Deb orah Estrin is with the Computer Science DepartmentInformation they have no impact on its correctness since all data losses Sciences Institute University of Southern California email es trinuscedu are eventually recovered Scott Shenker is with the Xerox Palo Alto Research Center email The pap er is organized as follows Sections and de shenkerparcxeroxcom Lixia Zhang is with the Computer Science Department University of scrib e the hopscop ed error recovery and the groupscop ed California Los Angeles email lixiacsuclaedu error recovery mechanisms resp ectively Section presents This research was supp orted in part by the Advanced Research Pro jects Agency monitored by Fort Huachuca under contracts DABTC the simulation mo dels and analyzes the simulation results and by the National Science Foundation under grant award No and Section reviews related work We conclude in Section NCR The views expressed here do not reect the p osition or p olicy of the US government with a short summary 1 Although the delay from a memb er and the delay to a memb er may b e dierent SRM assumes the path b etween a pair of memb ers are symmet 2 SRM assumes most or all session memb ers not only the data source ric thus each memb er determines its oneway delay to another memb er by save all the application data If some memb ers do not save the data taking half of its measured roundtrip delay This symmetry assumption requested they simply do not participate in the error recovery pro cess should cause no p erformance p enalty even when the paths are asymmet 3 ric b ecause the delay b etween memb ers is mainly used to dierentiate The discussion of lo calizing session messages is outside the scop e of memb ers in setting their retransmission timers this pap er More information can b e found in Request Hop Count HopScop ed Error Recovery Each requester simply sets its request hop count large The simplest way to control the scop e of requests and enough to reach at least one memb er that is closer to the replies is to limit the numb er of hops they travel We source This memb er do es not necessarily share the same wish to use the minimum hop counts p ossible in requests data delivery path with the requester all that matters is and replies To minimize the hop limit for request mes that the upstream memb er is closer to the source than sages our design takes the approach that a memb er ps re the requester Hence the hop count to reach an upstream quest extends just far enough to reach some other memb er memb er for a memb er p regarding a source s in a session q who is closer to the source If the loss o ccurred b etween s G d can b e set to p q and p then q will b e able to retransmit the lost packet If the loss o ccurred elsewhere so that q missed the packet s d minfh j q G h h g pq sq sp p as well then we only need to make sure that q will send a request further up towards the source All that matters where h is the distance in terms of the numb er of hops pq is that at least one request makes it across the lossy link from p to q ie link where the loss o ccurs and it is likely that this comes from the closest memb er b ehind the lossy request r ste h memb ers request timer is set prop ortional link since eac e qu source re requester to the measured delay from the source replier re requester In the original SRM design a request is used to suppress qu e st as well as to ask for repair While lim duplicate requests er iting the hop count of the request message limits the over head it generates it also diminishes its ability to suppress Figure Multicasting requests with a limited hop count other memb ers from sending the same requests Fortu reduces the eectiveness of request suppression Scenario nately the request hop count in our mechanism generally in the string top ology sp eaking is relatively small compared to the distance in terms of the numb er of hops to the source Thus the re Because a limited hop count reduces the eectiveness of quest overhead p er loss is acceptable even though multiple request suppression multiple requests regarding the same requests for retransmitting the same data are generated loss may b e generated In particular two scenarios illus Moreover b ecause request timers are based on the propa trated in Figure and are known to cause duplicate re gation delay from the source a memb er far b ehind the lossy quests In Figure the hop count to an immediate up link may receive a reply b efore sending its own request stream memb er is smaller than the hop count to an im While we greatly limit the scop e of requests we require mediate downstream memb er Therefore requests sent by that a reply have sucient scop e to reach all memb ers who upstream memb ers can not reach their downstream mem share the same loss Since a replier do es not know where b ers to suppress them from sending out the same requests a packet is dropp ed it is dicult for the replier to de In the worst case the request overhead within the loss re cide how far the retransmission must go However if a gion can b e two requests p er link one traveling upstream requester assumes it is immediately b ehind the lossy link and the other downward We consider such overhead ac it can determine as we show b elow an upp er b ound on the ceptable hop count needed to reach all other memb ers b ehind the requester p The upp er b ound is called the proxy hop count lossy link requester q the requester acts as request proxy for memb ers b ecause requester When a replier receives a request who share the same loss source replier s r requester h hops away and the
Load more

Recommended publications
  • Readdressing Network Layers
    Readdressing Network Layers James McCauley Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2020-161 http://www2.eecs.berkeley.edu/Pubs/TechRpts/2020/EECS-2020-161.html August 14, 2020 Copyright © 2020, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Readdressing Network Layers By James Ash McCauley A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Scott Shenker, Chair Professor Sylvia Ratnasamy Professor Coye Cheshire Summer 2020 Readdressing Network Layers Copyright 2020 by James Ash McCauley 1 Abstract Readdressing Network Layers by James Ash McCauley Doctor of Philosophy in Computer Science University of California, Berkeley Professor Scott Shenker, Chair It has long been common practice to split the functionality of computer networks into distinct layers. In the context of the most common networks today, there are five such layers, bracketed by hardware at the lowest layer and application software at the highest. While this modularization has generally been a huge success story for the field, networks have now been subject to decades of changes in terms of both technologies and use cases.
    [Show full text]
  • Architectural Support for Security Management in Enterprise Networks
    ARCHITECTURAL SUPPORT FOR SECURITY MANAGEMENT IN ENTERPRISE NETWORKS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Martin Casado August 2007 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. UMI Number: 3281806 INFORMATION TO USERS The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. ® UMI UMI Microform 3281806 Copyright 2007 by ProQuest Information and Learning Company. All rights reserved. This microform edition is protected against unauthorized copying under Title 17, United States Code. ProQuest Information and Learning Company 300 North Zeeb Road P.O. Box 1346 Ann Arbor, Ml 48106-1346 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. (c) Copyright by Martin Casado 2007 All Rights Reserved ii Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. f f- f (Nick McKeown) Principal Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy.
    [Show full text]
  • Nick Feamster
    Nick Feamster Neubauer Professor [email protected] Department of Computer Science https://people.cs.uchicago.edu/˜feamster/ University of Chicago https://noise.cs.uchicago.edu/ 5730 South Ellis Avenue https://medium.com/@feamster/ Chicago, Illinois 60637 Research Interests My research focuses on networked computer systems, with an emphasis on network architecture and protocol design; network security, management, and measurement; routing; and anti-censorship techniques. The primary goal of my research is to design tools, techniques, and policies to help networks operate better, and to enable users of these networks (both public and private) to experience high availability and good end-to-end performance. The problems that I tackle often involve the intersection of networking technology and policy. I study problems in the pricing and economics of Internet interconnection, global Internet censorship and information control, the security and privacy implications of emerging technologies, and the performance of consumer, commercial, and enterprise networks. My research achieves impact through new design paradigms in network architecture, the release of open-source software systems, and data and evidence that can influence public policy discourse. Education Degree Year University Field Ph.D. 2005 Massachusetts Institute of Technology Computer Science Cambridge, MA Dissertation: Proactive Techniques for Correct and Predictable Internet Routing Sprowls Honorable Mention for best MIT Ph.D. dissertation in Computer Science Advisor: Hari Balakrishnan
    [Show full text]
  • A New Approach to Network Function Virtualization
    A New Approach to Network Function Virtualization By Aurojit Panda A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Scott J. Shenker, Chair Professor Sylvia Ratnasamy Professor Ion Stoica Professor Deirdre Mulligan Summer 2017 A New Approach to Network Function Virtualization Copyright 2017 by Aurojit Panda 1 Abstract A New Approach to Network Function Virtualization by Aurojit Panda Doctor of Philosophy in Computer Science University of California, Berkeley Professor Scott J. Shenker, Chair Networks provide functionality beyond just packet routing and delivery. Network functions such as firewalls, caches, WAN optimizers, etc. are crucial for scaling networks and in supporting new applications. While traditionally network functions were implemented using dedicated hardware middleboxes, recent efforts have resulted in them being implemented as software and deployed in virtualized environment . This move towards virtualized network function is commonly referred to as network function virtualization (NFV). While the NFV proposal has been enthusiastically accepted by carriers and enterprises, actual efforts to deploy NFV have not been as successful. In this thesis we argue that this is because the current deployment strategy which relies on operators to ensure that network functions are configured to correctly implement policies, and then deploys these network functions as virtual machines (or containers), connected by virtual switches are ill- suited to NFV workload. In this dissertation we propose an alternative NFV framework based on the use of static tech- niques such as type checking and formal verification.
    [Show full text]
  • Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott
    CRA Workshop on Academic Careers Federated for Women in Computing Science 23rd Annual ACM/IEEE International Symposium on Computing Computer Architecture FCRC ‘96 ACM International Conference on Research Supercomputing ACM SIGMETRICS International Conference Conference on Measurement and Modeling of Computer Systems 28th Annual ACM Symposium on Theory of Computing 11th Annual IEEE Conference on Computational Complexity 15th Annual ACM Symposium on Principles of Distributed Computing 12th Annual ACM Symposium on Computational Geometry First ACM Workshop on Applied Computational Geometry ACM/UMIACS Workshop on Parallel Algorithms ACM SIGPLAN ‘96 Conference on Programming Language Design and Implementation ACM Workshop of Functional Languages in Introductory Computing Philadelphia Skyline SIGPLAN International Conference on Functional Programming 10th ACM Workshop on Parallel and Distributed Simulation Invited Speakers Wm. A. Wulf ACM SIGMETRICS Symposium on Burton Smith Parallel and Distributed Tools Cynthia Dwork 4th Annual ACM/IEEE Workshop on Robin Milner I/O in Parallel and Distributed Systems Randy Katz SIAM Symposium on Networks and Information Management Sponsors ACM CRA IEEE NSF May 20-28, 1996 SIAM Philadelphia, PA FCRC WELCOME Organizing Committee Mary Jane Irwin, Chair Penn State University Steve Mahaney, Vice Chair Rutgers University Alan Berenbaum, Treasurer AT&T Bell Laboratories Frank Friedman, Exhibits Temple University Sampath Kannan, Student Coordinator Univ. of Pennsylvania Welcome to the second Federated Computing Research Conference, FCRC’96, which is David Wise, Steering being held May 20 - 28, 1996 at the Philadelphia downtown Marriott. This second Indiana University FCRC follows the same model of the highly successful first conference, FCRC’93, in Janice Cuny, Careers which nine constituent conferences participated.
    [Show full text]
  • Download and Use Untrusted Code Without Fear
    2 KELEY COMPUTER SCIENC CONTENTS INTRODUCTION1 CITRIS AND2 MOTES 30 YEARS OF INNOVATION GENE MYERS4 Q&A 1973–20 0 3 6GRAPHICS INTELLIGENT SYSTEMS 1RESEARCH0 DEPARTMENT STATISTICS14 ROC-SOLID SYSTEMS16 USER INTERFACE DESIGN AND DEVELOPMENT20 INTERDISCIPLINARY THEOR22Y 30PROOF-CARRYING CODE 28 COMPLEXITY 30THEORY FACULTY32 THE COMPUTER SCIENCE DIVISION OF THE DEPARTMENT OF EECS AT UC BERKELEY WAS CREATED IN 1973. THIRTY YEARS OF INNOVATION IS A CELEBRATION OF THE ACHIEVEMENTS OF THE FACULTY, STAFF, STUDENTS AND ALUMNI DURING A PERIOD OF TRULY BREATHTAKING ADVANCES IN COMPUTER SCIENCE AND ENGINEERING. THE FIRST CHAIR OF COMPUTER research in theoretical computer science received a Turing Award in 1989 for this work. learning is bringing us ever closer to the dream SCIENCE AT BERKELEY was Richard Karp, at Berkeley. In the area of programming languages and of truly intelligent machines. who had just shown that the hardness of well- software engineering, Berkeley research has The impact of Berkeley research on the practi- Berkeley’s was the one of the first top comput- known algorithmic problems, such as finding been noted for its flair for combining theory cal end of computer science has been no less er science programs to invest seriously in com- the minimum cost tour for a travelling sales- and practice, as exemplified in these pages significant. The development of Reduced puter graphics, and our illustrious alumni in person, could be related to NP-completeness— by George Necula’s research on proof- Instruction Set computers by David Patterson that area have done us proud. We were not so a concept proposed earlier by former Berkeley carrying code.
    [Show full text]
  • Enabling a Permanent Revolution in Internet Architecture
    Enabling a Permanent Revolution in Internet Architecture James McCauley Yotam Harchol Aurojit Panda UC Berkeley & ICSI UC Berkeley New York University [email protected] [email protected] [email protected] Barath Raghavan Scott Shenker University of Southern California UC Berkeley & ICSI [email protected] [email protected] ABSTRACT architecture is seriously deficient along one or more dimensions. Recent Internet research has been driven by two facts and their The most frequently cited architectural flaw is the lack of a coher- contradictory implications: the current Internet architecture is both ent security design that has left the Internet vulnerable to various inherently flawed (so we should explore radically different alterna- attacks such as DDoS and route spoofing. In addition, many ques- tive designs) and deeply entrenched (so we should restrict ourselves tion whether the basic service model of the Internet (point-to-point to backwards-compatible and therefore incrementally deployable packet delivery) is appropriate now that the current usage model improvements). In this paper, we try to reconcile these two perspec- is so heavily dominated by content-oriented activities (where the tives by proposing a backwards-compatible architectural framework content, not the location, is what matters). These and many other called Trotsky in which one can incrementally deploy radically new critiques reflect a broad agreement that despite the Internet’s great designs. We show how this can lead to a permanent revolution in success, it has significant architectural problems. Internet architecture by (i) easing the deployment of new architec- However, the second widely-accepted observation is that the cur- tures and (ii) allowing multiple coexisting architectures to be used rent Internet architecture is firmly entrenched, so attempts to sig- simultaneously by applications.
    [Show full text]
  • Curriculum Vitae
    Michael J. Freedman Princeton University www.michaelfreedman.org Dept. of Computer Science [email protected] 35 Olden Street @michaelfreedman Princeton, NJ 08540-5233 Phone: (609) 258-9179 Academics Princeton University . Princeton, NJ Full Professor of Computer Science . .Sept 2015 – onward Associate Professor (with tenure) of Computer Science . July 2013 – Aug 2015 Assistant Professor of Computer Science . Sept 2007 – June 2013 New York University, Courant Institute . .New York, NY Ph.D. in Computer Science . Sept 2007 Thesis title: Democratizing Content Distribution Visited Stanford University to accompany advisor, Sept 2005 – Aug 2007 Advisor: David Mazieres` ; GPA: 4.0/4.0 M.S. in Computer Science . May 2005 Advisor: David Mazieres` ; GPA: 4.0/4.0 Massachusetts Institute of Technology . Cambridge, MA M.Eng. in Electrical Engineering and Computer Science . June 2002 Thesis title: A Peer-to-Peer Anonymizing Network Layer Advisor: Robert Morris ; GPA: 5.0/5.0 S.B. in Computer Science, Minor in Political Science . .June 2001 Thesis title: An Anonymous Communications Channel for the Free Haven Project Advisor: Ron Rivest ; GPA: 4.9/5.0 Wyoming Valley West High School . Plymouth, PA Class Valedictorian (1 / 314), June 1997. National Merit Finalist, A.P. Scholar with Distinction Interests Distributed systems, networking, and security. Work experience 9/15–present Princeton University, Full Professor, Princeton, NJ. 2/14–present Timescale, Co-Founder & CTO, New York, NY. Timescale (time-series database company) has raised $32M from top VCs (Benchmark, New Enterprise Associates, Icon Ventures, Two Sigma Ventures). 7/13–8/15 Princeton University, Associate Professor (with tenure), Princeton, NJ. 8/07–6/13 Princeton University, Assistant Professor, Princeton, NJ.
    [Show full text]
  • Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch H
    [Draft article] Spam: It’s Not Just for Inboxes and Search Engines! Making Hirsch h-index Robust to Scientospam Dimitrios Katsaros1,2 Leonidas Akritidis1 Panayiotis Bozanis1 1Dept. of Computer & Communication Engineering, University of Thessaly, Volos, Greece 2Dept. of Informatics, Aristotle University, Thessaloniki, Greece [email protected], {leoakr,pbozanis}@inf.uth.gr Abstract What is the ‘level of excellence’ of a scientist and the real impact of his/her work upon the scientific thinking and practising? How can we design a fair, an unbiased metric – and most importantly – a metric robust to manipulation? Quantifying an individual’s scientific merit The evaluation of the scientific work of a scientist has long attracted significant interest, due to the benefits by obtaining an unbiased and fair criterion. A few years ago such metrics were yet another topic of investigation for the scientometric community with only theoretical importance, without any practical extensions. Very recently though the situation has dramatically changed; an increasing number of academic institutions are using such scientometric indicators to decide faculty promotions. Automated methodologies have been developed to calculate such indicators [6]. Also, fund- ing agencies use them to allocate funds, and recently some governments are considering the consistent use of such metrics for funding distribution. For instance, the Australian govern- ment has established the Research Quality Framework (RQF) as an important feature in the fabric of research in Australia1; the UK government has established the Research Assessment Exercise (RAE) to produce quality profiles for each submission of research activity made by institution2. The use of such indicators to characterize a scientist’s merit is controversial, and a plethora arXiv:0801.0386v1 [cs.DL] 2 Jan 2008 of arguments can be stated against their use.
    [Show full text]
  • Novel Frameworks for Mining Heterogeneous and Dynamic
    Novel Frameworks for Mining Heterogeneous and Dynamic Networks A dissertation submitted to the Graduate School of the University of Cincinnati in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical and Computer Engineering and Computer Science of the College of Engineering by Chunsheng Fang B.E., Electrical Engineering & Information Science, June 2006 University of Science & Technology of China, Hefei, P.R.China Advisor and Committee Chair: Prof. Anca L. Ralescu November 3, 2011 Abstract Graphs serve as an important tool for discrete data representation. Recently, graph representations have made possible very powerful machine learning algorithms, such as manifold learning, kernel methods, semi-supervised learning. With the advent of large-scale real world networks, such as biological networks (disease network, drug target network, etc.), social networks (DBLP Co- authorship network, Facebook friendship, etc.), machine learning and data mining algorithms have found new application areas and have contributed to advance our understanding of proper- ties, and phenomena governing real world networks. When dealing with real world data represented as networks, two problems arise quite naturally: I) How to integrate and align the knowledge encoded in multiple and heterogeneous networks? For instance, how to find out the similar genes in co-disease and protein-protein inter- action networks? II) How to model and predict the evolution of a dynamic network? A real world exam- ple is, given N years snapshots of an evolving social network, how to build a model that can cap- ture the temporal evolution and make reliable prediction? In this dissertation, we present an innovative graph embedding framework, which identifies the key components of modeling the evolution in time of a dynamic graph.
    [Show full text]
  • PURDUE UNIVERSITY GRADUATE SCHOOL Thesis/Dissertation Acceptance
    Graduate School Form 30 Updated PURDUE UNIVERSITY GRADUATE SCHOOL Thesis/Dissertation Acceptance This is to certify that the thesis/dissertation prepared By Harold Owens II Entitled PROVISIONING END-TO-END QUALITY OF SERVICE FOR REAL-TIME INTERACTIVE VIDEO OVER SOFTWARE-DEFINED NETWORKING For the degree of Doctor of Philosophy Is approved by the final examining committee: Arjan Durresi Chair Mohammad Al Hasan Xia N. Ning Raje R. Rajeev To the best of my knowledge and as understood by the student in the Thesis/Dissertation Agreement, Publication Delay, and Certification Disclaimer (Graduate School Form 32), this thesis/dissertation adheres to the provisions of Purdue University’s “Policy of Integrity in Research” and the use of copyright material. Approved by Major Professor(s): Arjan Durresi Approved by: Shiaofen Fang 11/22/2016 Head of the Departmental Graduate Program Date PROVISIONING END-TO-END QUALITY OF SERVICE FOR REAL-TIME INTERACTIVE VIDEO OVER SOFTWARE-DEFINED NETWORKING A Dissertation Submitted to the Faculty of Purdue University by Harold Owens II In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy December 2016 Purdue University Indianapolis, Indiana ii To my mother (1947-2006). To my wife, daughter, and son. Thank you. iii ACKNOWLEDGMENTS I want to acknowledge my mentor and advisor, Dr. Arjan Durresi for his encour- agement and guidance during my studies. I want to acknowledge thesis committee members Dr. Rajeev Raje, Dr. Xia Ning, and Dr. Mohammad Al Hasan for reviewing and providing feedback
    [Show full text]
  • Aurojit Panda – Curriculum Vitae
    14 Washington Pl, Apt 7M Aurojit Panda New York, NY 10003 H +1 (401) 323 1524 B [email protected] Curriculum Vitae Í cs.nyu.edu/~apanda Research Interests Computer Systems, Distributed Systems, Networking Education 2011–2017 Ph.D. Computer Science, University of California, Berkeley, CA. Advisor: Scott Shenker 2004–2008 Sc.B. Math–Computer Science, Brown University, Providence, RI. Honors in Math–Computer Science Advisor: Meinolf Sellmann Professional Employment Aug 2018– Assistant Professor, Courant Institute, New York University, New York, NY. 2017–2018 Software Developer, Nefeli Networks, Berkeley, CA. 2011–2017 Research Assistant, UC Berkeley, Berkeley, CA. 2008–2011 Software Developer, Microsoft, Redmond, WA. Summer ’07 Software Engineering Intern, Electronic Arts, Redwood City, CA. Summer ’06 Software Engineering Intern, Bloomberg LP, New York, NY. Teaching Experience Fall ’13 TA for EE122 (Undergraduate Networking), UC Berkeley, Berkeley, CA. Fall ’12 { Taught about 20 students in a weekly discussion section. { Designed problem sets and projects, ran a project involving plug computers 2006–2008 Undergraduate TA, CS Department, Brown University, Providence, RI. { TAed CS51 (Models of Computation), CS138 (Distributed Computing), CS166 (Security), CS167 (Operating Systems) and CS169 (Operating Systems Lab). { Helped with designing new content and projects for distributed systems and security. { Helped design and grade problem sets and projects. Fall ’05 Reader, Math Department, Brown University, Providence, RI. { Graded problem sets and exams for Honors Linear Algebra. Awards { Demetri Angelakos Memorial Achievement Award, Berkeley EECS 2016-17 { Best Student Paper, SIGCOMM 2015 { Best Paper, EuroSys 2013 { Qualcomm Innovation Fellowship 2012 Publications Conferences • Radhika Mittal, Alex Shpiner, Aurojit Panda, Eitan Zahavi, Arvind Krishnamurthy, Sylvia Ratnasamy, and Scott Shenker.
    [Show full text]