Sugih Jamin's Publications

 

Vitae

Multiplayer Gaming:

Papers on multiplayer gaming can be found at our multiplayer gaming web site.

Internet Distance Maps:

Papers on IDMaps can be found at the IDMaps web site.

Internet Topology:

Papers on Internet topology can be found at our topology web site.

Network Security:

``On the Performance, Feasibility, and Use of Forward-Secure Signatures,'' Proc. of ACM CCS 2003, Oct. 27-31, 2003, with Cronin, E., Mankin,T., and McDaniel, P.

``Windowed Certificate Revocation,'' Proc. of IEEE Infocom 2000, March 26-30, 2000, with McDaniel, P.

Measurement-based Admission Control Algorithms:

The main motivation for doing measurement-based, as opposed to parameter-based, admission control is so that you can achieve higher level of network utilization while meeting user quality of service requirements, most of the time. If you are new to measurement-based admission control algorithms, the paper entitled ``A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks'' is a good place to start. The techinal report ``Measurement-based Admission Control Algorithms for Controlled-load Service: A Structural Examination'' is a follow on to the work published in ``Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service.'' Lee Breslau and I have also published an Internet-Draft under the int-serv working group titled, ``A Measurement-based Admission Control Algorithm for Controlled-load Service.'' Sally Floyd maintains a page of literature on measurement-based admission control algorithms for controlled-load service.

``Comments on the Performance of Measurement-Based Admission Control Algorithms,'' Proc. of IEEE Infocom 2000, March 26-30, 2000, with Breslau, L. and Shenker, S.

``Measurement-based Admission-Controlled Web Server,'' Proc. of IEEE Infocom 2000, March 26-30, 2000, with Li, K.

``Measurement-Based Admission Control: What is the Research Agenda?'' Proc. Int'l Workshop on Quality of Service '99, May 31 - June 4, 1999, London, UK, with Breslau L., and Shenker, S.

``Design, Implementation, and End-to-end Evaluation of a Measurement-based Admission Control Algorithm for Controlled-Load Service,'' Proc. of the 8th Int'l Workshop on Network and Operating System Support for Digital Audio and Video 1998, with Cheng Jin. Abstract

A Measurement-based Admission Control Algorithms for Controlled-load Service, Internet-Draft, draft-ietf-intserv-control-flow-01.txt, Oct. 1997, with Lee Breslau. Abstract

Measurement-based Admission Control Algorithms for Controlled-load Service: A Structural Examination, University of Michigan CSE-TR-333-97, Apr. 1997, with Scott Shenker. Abstract

``Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service,'' Proc. IEEE INFOCOM '97, April 1997, with Scott Shenker and Peter Danzig. Abstract  Slides

``A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks,'' IEEE/ACM Transactions on Networking, 5(1):56-70. Feb. 1997, with Peter Danzig, Scott Shenker, and Lixia Zhang. Abstract  Slides

A shorter version of this work won the Best Student Paper Award at Proc. ACM SIGCOMM '95. An extended abstract of an earlier version was published in Proc. of the Third International Workshop on Network and Operating System Support for Digital Audio and Video 1992, with Scott J. Shenker, Lixia Zhang, and David D. Clark. It is also the title of my Ph.D. dissertation: A Measurement-based Admission Control Algorithm for Integrated Services Packet Networks, USC Tech Report, USC-CS-96-639, 1996.

Market-based Resource Allocation

``Differentiated Services with Lottery Queueing,'' Int'l Workshop on Quality of Service (IWQoS'01), June 2001, Karlsruhe, Germany, with Eggleston, J.E.

``Survivability through Market-Based Adaptivity: The MARX Project,'' DARPA Information Survivability Conference & Exposition (DISCEX'00), Jan. 25-27, 2000, South Carolina, with Eggleston, J.E., Kelly, T.P., MacKie-Mason, J.K., Walsh, W.E, and Wellman, M.

``A Case for Market-based Pushed Caching,'' Proc. of the 2nd Int'l Conf. on Telecommunicatons and Electronic Commerce (ICTEC}, 1999, with Chan, Y-M., Womer, J.P., and MacKie-Mason, J. K.

``Variable QoS from Shared Web Caches: User-centered Design and Value-sensitive Replacement,'' Workshop on Internet Service Quality Economics, Dec. 2-3, 1999, MIT, with Kelly, T.P., and MacKie-Mason, J.K.

``One size doesn't fit all: Improving network QoS through preference-driven Web caching,'' 2nd Berlin Internet Economics Workshop, Berlin, Germany May 28-29 1999, with Chan, Y-M., Womer, J.P., and MacKie-Mason, J.K.

``Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value,'' Proc. of the 4th Int'l Web Caching Workshop, San Diego, California, 31 March - 2 April 1999, with Kelly, T.P., Chan, Y-M., Jamin, S., and MacKie-Mason, J. K.

TCP Applications Traffic Characterization:

Tcplib (rhymes with tribe) is a library containing observed TCP application characteristics. It is meant to be linked with a simulator and be used as a workload generator. Steve McCanne's ns simulator is rumoured to include tcplib. Tcplib can also be used to generate workload on network testbed. The technical report tcplib: A Library of TCP Internetwork Traffic Characteristics explains how to use tcplib and the paper ``An Empirical Workload Model for Driving Wide-Area TCP/IP Network Simulations'' describes the data we used to create tcplib, along with some observations on the data.

``An Empirical Workload Model for Driving Wide-Area TCP/IP Network Simulations,'' Journal of Internetworking 3:1, pp. 1-26, March 1992, with Peter Danzig, Ramon Caceres, Danny Mitzel, and Deborah Estrin. Also published as ``Characteristics of Wide-Area TCP/IP Conversations,'' Proc. ACM SIGCOMM '91. Abstract

tcplib: A Library of TCP Internetwork Traffic Characteristics, USC Tech. Report, USC-CS-91-495, 1991, with Peter Danzig. Abstract  Code