📄 http:^^dworkin.wustl.edu^~varghese^
字号:
Date: Thu, 21 Nov 1996 21:34:17 GMTServer: NCSA/1.4Content-type: text/html<html><head><title> George Varghese's Home Page </title></head><!WA0><img align=top src="http://dworkin.wustl.edu/~varghese/picture.gif"><h1>George Varghese </h1><body><dl><i><dt>Associate Professor<dt><!WA1><A href="http://www.wustl.edu">Washington University</a> </i> <p></dl></a><dl><dt><b>Snail mail:</b><p>Washington University, Campus Box 1045/Bryan 509<br>One Brookings Drive<br>Saint Louis, MO 63130-4899<br><p>Office: Bryan 405D<br>314-935-4963 (office)<br>314-935-7302 (fax)<br>Email: <!WA2><a href="mailto:varghese@askew.wustl.edu">varghese@askew.wustl.edu</a><br></dl><hr><h2>RESEARCH INTERESTS</h2><p>I spent 10 years designing real network protocols (some of which are inproducts) for DECNET. However, I later did my Ph.D. research in thetheory of protocol design. For more details, see my <!WA3><a href="http://dworkin.wustl.edu/~varghese/vita.ps"> vita </a>.For recent papers, click<!WA4><a href="http://dworkin.wustl.edu/~varghese/directions.html"> here </a>.<p> My goal is to fruitfully combine myexperience in distributed systems, both theory and practice. My most recent work in network protocols includes the first O(log(log(n)) algorithm for fair queuing, new techniques for fragmentation and reassembly,and new load balancing protocols. Recent work in distributed algorithmsinclude a result that shows that crash failures can cause almost all asynchronous protocols to fail (assuming that nodes keep no NVRAM acrosscrashes), and techniques for making window protocols self-stabilizing.Web pointers to .ps files can be found below.The work on distributed algorithms is supported byan ONR Young Investigator Award and a grant from NSF; the work in network protocols is supported by an NSF Research Initiation Award.<p> Past work on network protocols includes techniques for speeding uppacket processing based on adding fields to packets, making hop-by-hopflow control both efficient and reliable, efficient fair queuingusing deficit round robin, and efficient timer algorithms. Patents for past work include patents for bridge protocols, switch design, the OSI routing update protocol, and rate based flow control.Past work on distributed algorithmsincludes (together with colleagues at MIT and Univ of Texas) a set ofgeneral techniques to make protocols self-stabilizing. A protocol isself-stabilizing if it begins to work correctly regardless of whatstate the protocol starts in: thus self-stabilization is anabstraction of a strong fault-tolerance property. Some of thetechniques we have discovered (for making protocols self-stabilizing) include local checking and correction,local checking and global correction, compiling synchronous protocol, counter flushing, and window washing.<p> I hope that coupling these two themes(distributed algorithms and network protocols, theory and practice)will provide a rich synergy both in terms of research and coursework.For example, I have taught the network protocol class for senior Wash Uundergraduates for three semesters, and have taught them someprotocol design techniques. I taught the Distributed Algorithms class in theSpring of 95 and taught a tutorial on applying techniques from distributed algorithms in SIGCOMM 95. I illustrated the theory using many real-world protocol examples. I will teach a tutorial on efficientprotocol implementation techniques in SIGCOMM 96.<p> <hr><h2>RECENT PAPERS </h2>My recent papers on both networking andself-stabilization can be obtained from the web.To look at a brief description ofavailable papers, and then navigate to papers you would like, please click <!WA5><a href="http://dworkin.wustl.edu/~varghese/directions.html"> here</a>.<hr><h2> QUOTES </h2>For some quotes on things I believe in, please click<!WA6><a href="http://dworkin.wustl.edu/~varghese/quotes.html"> here</a>.<hr><h2>EDUCATION</h2><ul><li> PhD in Computer Science -- MIT (2/93)<li> MS in Computer Science -- NCSU (8/83)<li> B.Tech in Electrical Engineering -- I.I.T. Bombay, India (8/81)</ul><hr><h2>STUDENTS </h2><ul><li> <!WA7><a href = "http://dworkin.wustl.edu/~girish/"> Girish Chandranmenon </a>.<br><B> Current projects: </B> trading packet headers for packet processing, efficient fair queuing, new techniques for fragmentation and reassembly.During Summer 96, working with Steve Deering on IPv6 related issues.<li> <!WA8><a href = "http://dworkin.wustl.edu/~jmahesh/"> Mahesh Jayaram </a>.<br><B> Current projects: </B> Determining the fault-span of crash failures,efficient packet filters, and improving routing protocol performance.<li> <!WA9><a href = "http://www.cs.wustl.edu/~amc/"> Adam Costello </a>.<br><B> Current projects: </B> UNIX Implementation of Timing Wheels, Self-stabilization by window washing (making window protocols self-stabilizing), mobile networks. From Fall 96, will be doing a Ph.D at Berkeley in the mobile computing group.</ul><h2>CS 423 DOCUMENTS </h2>I"ll start trying to make CS 423 documents available on the web.To look at a sample midterm please click <!WA10><a href="http://dworkin.wustl.edu/~varghese/cs423/handout.ps">here</a>.<h2>COURSE OUTLINE FOR CS564T</h2>In the spring of 1995, I taught a course on concurrent messagepassing algorithms, with emphasis on applications to network protocols.The course is designed to help students learn how to design protocolsand to apply them to the problems of real networks. Thus weillustrate the main ideas using actual protocols from existing networks.I taught an abbreviated version of that course as a tutorial in SIGCOMM 95.<p>To look at a course outline for CS 564, please click <!WA11><a href="http://dworkin.wustl.edu/~varghese/outline564.html">here</a>.To look at the slides for the SIGCOMM tutorial, please click <!WA12><a href="http://dworkin.wustl.edu/~varghese/PAPERS/tutSIG95.ps.Z"> here</a>. Its in landscape format and you may have to "swap landscape" the file before viewing.<p><hr><h2>SELF-STABILIZATION INTEREST GROUP</h2><p>User names registered as of Dec 13th 1994:<p>sandeep@cs.albany.edu mischu@research.att.com herman@cs.uiowa.edu kutten@watson.ibm.com cowen@brutus.mts.jhu.edu burns@nova.bellcore.com loui@geisel.csl.uiuc.edu jhh@cwi.nl kirousis@cti.gr sriram@cs.uiowa.edu fischer-michael@cs.yale.edu masuzawa@is.aist-nara.ac.jp garay@watson.ibm.com zaks@cs.ust.hk marco@cs.utexas.edu prasad@cs.dartmouth.edu<p><hr><h2>SHORT PROJECTS FOR NETWORKING CERTIFICATION COURSE</h2>I am offering only one project currently. This project involves adetailed design of a fault-tolerant token ring protocol that canreplace an existing token ring protocol like the IBM Token Ring orFDDI. To look at a brief description of this project, please click <!WA13><a href="http://dworkin.wustl.edu/~varghese/tr.html"> here</a>.<p><hr>Last updated on October 20, 1994.<address> varghese@askew.wustl.edu </address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -