<rss version="2.0">
<channel>
<title>Mark Allman's Research Activities</title>
<link>http://www.icir.org/mallman/research</link>
<description>Mark Allman's Research Activites</description>
<item>
<title>Appropriate Byte Counting</title>
<link>http://www.icir.org/mallman/research/proj-abc.html</link>
<guid isPermaLink="false">1123771897</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Appropriate Byte Counting</b>
<p>
For a while I have been working on a slight change in the way TCP 
increases it congestion window called <i>appropriate byte counting</i>.
The scheme has performance and security benefits (at the cost of 
increasing burstiness a bit).  A few references:
<ul>
<li>Mark Allman.
<i><a href="/mallman/papers/rfc3465.txt">
TCP Congestion Control with Appropriate Byte Counting (ABC)</a></i>, 
February 2003.  RFC 3465.
<p>
<li>Mark Allman.
<i>
<a href="/mallman/papers/bc-ccr.ps">
TCP Byte Counting Refinements</a></i>.  ACM Computer Communication
Review, 29(3), July 1999.
<p>
<li>Mark Allman.  <i><a href="/mallman/papers/acks.ps">On the Generation 
and Use of TCP Acknowledgments</a></i>.  ACM Computer Communication Review,
28(5), October 1998.
<p>
<li>
Mark Allman.
<a href="/mallman/papers/ms-thesis.ps">
<i>Improving TCP Performance Over Satellite
Channels</i></a>. Master's Thesis, Ohio University, June 1997. 
</ul>
<p>
(Posted: Sun Oct 20, 2002; Updated: Thu Feb  6, 2003)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:51:37 EDT 2005
</pubDate>
</item>
<item>
<title>Bursting in TCP</title>
<link>http://www.icir.org/mallman/research/proj-bursting.html</link>
<guid isPermaLink="false">1137074552</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Bursting in TCP</b>
<p>
<a href="http://www.cs.purdue.edu/homes/eblanton/">
Ethan Blanton</a> and I have been working on both assessing the amount
and the impact of micro-bursting on TCP performance in the wild, as
well as avaluating ways to cope with micro-bursting within TCP.

<p>

<b>Papers</b>

<ul>
<li>Janardhan Iyengar, Mark Allman, Ethan Blanton.
  <a href="/mallman/papers/draft-iyengar-burst-mitigation-01.txt">
  <i>TCP Burst Mitigation Through Congestion Window Limiting</i></a>,
  January 2006.  Internet-Draft draft-iyengar-burst-mitigation-01.txt 
  (work in progress).
<p>
<li>Mark Allman, Ethan Blanton.
  <i><a href="/mallman/papers/burst-mitigate.ps">
  Notes on Burst Mitigation for Transport Protocols</i></a>.  ACM
  Computer Communication Review, 35(2), April 2005.
<p>
<li>Ethan Blanton, Mark Allman.  
  <a href="/mallman/papers/burst-pam05.ps"><i>On the Impact of Bursting
  on TCP Performance</i></a>.  Proceedings of the Workshop for Passive
  and Active Measurement, March 2005.  Presentation slides 
  <a href="/mallman/papers/burst-pam05-talk.pdf">available</a>.
</ul>

(Posted: Fri Feb 25, 2005; Updated: Wed Jan 11, 2006)
]]>
</content>
</description>
<pubDate>Thu Jan 12 09:02:32 EST 2006
</pubDate>
</item>
<item>
<title>Energy-Aware Network Architecture</title>
<link>http://www.icir.org/mallman/research/proj-energy-arch.html</link>
<guid isPermaLink="false">1216662508</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<p>
<b>Energy-Aware Network Architecture</b>
<p>
The current network architecture often assumes hosts are either connected
or disconnected and often assumes connectivity for smooth operation.  We
are thinking about a new network architecture that allows hosts to be
"selectively connected" to the network such that they can power down to 
conserve power, but do so without losing their standing or presence in
the network.
<p>
<b>People</b>
<ul>
<li><a href="http://www.icir.org/mallman/">Mark Allman</a>
<li><a href="http://www.icir.org/vern/">Vern Paxson</a>
<li><a href="http://www.csee.usf.edu/~christen/christen.html">Ken 
  Christensen</a>
<li><a href="http://www.lbl.gov/~bnordman/">Bruce Nordman</a>
</ul>
<p>
<b>Papers</b>
<ul>
<li>Mark Allman, Ken Christensen, Bruce Nordman, Vern Paxson.
  <a href="/mallman/papers/select-conn-hotnets07.pdf">
  <i>Enabling an Energy-Efficient Future Internet Through
  Selectively Connected End Systems</i></a>.  ACM HotNets, November 2007.
  Talk slides
  <a href="/mallman/papers/select-conn-hotnets07-talk.pdf">available</a>.
</ul>
<p>
<b>Misc.</b>
<ul>
<li>Project
  <a href="/mallman/papers/find-energy-poster-nov07.pdf">poster</a>
  presented at the November 2007 FIND PI meeting.
</ul>

<p>
(Posted: Thu Nov 15, 2007; Updated: Mon Jul 21, 2008)
]]>
</content>
</description>
<pubDate>Mon Jul 21 13:48:28 EDT 2008
</pubDate>
</item>
<item>
<title>Enterprise Measurement</title>
<link>http://www.icir.org/mallman/research/proj-enterprise.html</link>
<guid isPermaLink="false">1165933611</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Enterprise Measurement</b>
<p>
We are attempting to look at traffic characteristics <i>inside</i> 
enterprise networks to (<i>i</i>) assess how traffic characteristics
differ from characteristics found in wide-area networks and (<i>ii</i>)
to provide models of "background traffic" for the community (and for 
security researchers in particular, for testing defense mechanisms).
<p>

<b>Papers:</b>

<ul>
<li>
  Ruoming Pang, Mark Allman, Vern Paxson, Jason Lee.  
  <a href="/mallman/papers/devil-ccr-jan06.pdf"><i>The Devil and Packet 
  Trace Anonymization</i></a>.  ACM Computer Communication Review, 36(1), 
  January 2006.
  The public review of this paper is avalable
  <a href="devil-ccr-jan06-pubrev.pdf">here</a>.
<p>
<li>Ruoming Pang, Mark Allman, Mike Bennett, Jason Lee, Vern Paxson, 
  Brian Tierney.  <a href="/mallman/papers/first-look-imc05.pdf"><i>
  A First Look at Modern Enterprise Traffic</i></a>.  ACM SIGCOMM/USENIX 
  Internet Measurement Conference, October 2005.
  <br>
  Ruoming's talk: 
  [<a href="2005/first-look-imc05-slides.pdf">PDF</a>,
   <a href="2005/first-look-imc05-slides.ppt">PPT</a>]
</ul>

<p>

We have also made available over 100 hours of anonymized enterprise
packet traces available from the main project web page, which is
<a href="http://www.icir.org/enterprise-tracing/">here</a>.

<p>
(Posted: Thu Aug 11, 2005; Updated: Tue Dec 12, 2006)
]]>
</content>
</description>
<pubDate>Tue Dec 12 09:26:51 EST 2006
</pubDate>
</item>
<item>
<title>Explicit Error Transport Notification</title>
<link>http://www.icir.org/mallman/research/proj-eten.html</link>
<guid isPermaLink="false">1123771945</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Explicit Error Transport Notification</b>
<p>
I have worked with a number of folks recently on the problem of making
TCP robust to non-congestion segment loss.  Recently I have been working
with <a href="http://irg.cs.ohiou.edu/~weddy/">Wes Eddy</a> and 
<a href="http://ace.cs.ohiou.edu/~osterman/">Shawn Ostermann</a> on
using aggregate feedback from the network to help make TCP robust to
links with non-negligable BERs.  References:

<p>

<b>Papers, Reports, Etc.</b>
<ul>
  <li>Wesley Eddy, Shawn Ostermann, Mark Allman.
    <i><a href="/mallman/papers/ceten-ccr-oct2004.ps">
	 New Techniques for Making Transport Protocols Robust to 
	 Corruption-Based Loss</i></a>.  ACM Computer Communication 
      Review, 34(5), October 2004.  To appear.
  <p>

  <li>Rajesh Krishnan, James Sterbenz, Wesley Eddy, Craig Partridge, 
    Mark Allman.  <a href="/mallman/papers/eten-comnet.ps">
		    <i>Explicit Transport Error Notification (ETEN) for 
		      Error-Prone Wireless and Satellite Networks</i></a>.  
    Computer Networks, 46(3), October 2004.
  <p>

  <li>Wesley Eddy.  <a href="/mallman/research/2004/ceten-e-thesis.pdf">
    <i>Improving TCP Performance with Path Error Rate
    Information</i></a>.  Master's Thesis, Ohio University, March 2004.
    <a href="/mallman/research/2004/ceten-defense-slides.pdf">Defense 
      slides</a>.
  <p>

  <li>Rajesh Krishnan, Mark Allman, Craig Partridge, James P.G.
    Sterbenz, William Ivancic.  
    <a href="/mallman/papers/eten-exec-summary.pdf"><i>
    Explicit Transport Error Notification (ETEN) for Error-Prone Wireless 
    and Satellite Networks - Summary</i></a>.  Earth Science Technology 
    Conference, Pasadena, CA, June 2002.
  <p>

  <li>Rajesh Krishnan, Mark Allman, Craig Partridge, James P.G. Sterbenz.
    <i><a href="/mallman/papers/TR8333.ps">
    Explicit Transport Error Notification (ETEN) for Error-Prone Wireless 
    and Satellite Networks</i></a>.  Technical Report No. 8333, BBN 
    Technologies, March 2002.
</ul>

<p>

<b>Talks</b>

<ul>
  <li>Mark Allman.  <i>A(nother) Technique for Improving Transport 
		      Protocol Performance in Lossy Networks</i>.  ICIR
    Wednesday Lunch, April 2004.  <a href="/mallman/talks/ceten-icir-lunch.ps">
				    Slides</a>.
  <p>

  <li>Mark Allman.  <i>Improving Performance of Internet Protocols Over 
    Wireless Networks</i>.  Kent State University CS Seminar,
    November 2003.  (Previously given at Case Western Reserve University's 
    EECS seminar series.)
    <a href="/mallman/research/2003/ceten-ksu-nov03.pdf">Slides.</a>
  <p>

  <li>Wesley Eddy, Shawn Ostermann, Mark Allman.  
    <i>New Techniques for Making TCP Robust to Corruption-Based Loss</i>.
    Third Space Internet Workshop, June 2003.  
    <a href="/mallman/research/2003/ceten-siw3.txt">Talk abstract.</a>
    <a href="/mallman/research/2003/ceten-siw3.pdf">Slides.</a>
    <a href="/mallman/research/2003/ceten-siw3-notes.txt">Wes' talk notes.</a>
</ul>

<p>

(Posted: Mon Feb 24, 2003; Last Updated: Tue Sep 21, 2004)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:52:25 EDT 2005
</pubDate>
</item>
<item>
<title>Thwarting Attacks Through Cross-Organization Information Sharing</title>
<link>http://www.icir.org/mallman/research/proj-history.html</link>
<guid isPermaLink="false">1216662881</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Thwarting Attacks Through Cross-Organization Information Sharing</b>
<p>

We have been working on several ideas to use practical cross-organizational
information sharing to find attackers and mitigate their impact.
<p>

<b>People:</b>
<ul>
  <li><a href="http://www.cs.purdue.edu/homes/eblanton/">Ethan
    Blanton</a>
  <li><a href="http://www.icir.org/vern/">Vern Paxson</a> 
  <li><a href="http://www.icir.org/shenker/">Scott Shenker</a>
</ul>

<b>Papers:</b>
<ul>
<li>Mark Allman, Christian Kreibich, Vern Paxson, Robin Sommer,
  Nicholas Weaver.  <a href="/mallman/papers/awareness-hotsec08.pdf">
  <i>Principles for Developing Comprehensive
  Network Visibility</i></a>.  USENIX Workshop on Hot Topics in Security,
  July 2008.  To appear.
<p>
<li>Mark Allman, Ethan Blanton, Vern Paxson, Scott Shenker.
  <a href="/mallman/papers/info-sharing-hotnets06.pdf">
  <i>Fighting Coordinated Attackers with Cross-Organizational
  Information Sharing</i></a>.  ACM SIGCOMM HotNets, November 2006. 
  <a href="2006/elb-hotnets06.pdf">Presentation slides</a>.
  Public review
  <a href="/mallman/papers/info-sharing-hotnets06-pubrev.pdf">
  available</a>.
<p>
<li>Mark Allman, Ethan Blanton, Vern Paxson.  
  <a href="/mallman/papers/history-sruti05.ps"><i>An Architecture for 
  Developing Behavioral History</i></a>.  Workshop on Steps to Reduce
  Unwanted Traffic on the Internet (SRUTI), July 2005.  Presentation
  slides <a href="/mallman/papers/history-sruti05-talk.pdf">available</a>.
</ul>

<p>

<b>Talks:</b>
<ul>
<li>Mark Allman.  
  <i><a href="/mallman/talks/info-share-case-oct06.pdf">
  Improving Internet Security Through Cross-Organizational 
  Information Sharing</a></i>.  Case Western Reserve University 
  EECS Seminar, October 2006. 
<p>
<li>Mark Allman.  
  <i><a href="/mallman/talks/info-share-ohioice-oct06.pdf">
  Sharing Information for Better Network Security</a></i>.  
  Ohio ICE Fall Technical Conference, October 2006.
<p>
<li>Mark Allman.
  <a href="/mallman/talks/history-cwru.pdf"><i>An Architecture for Developing 
  Behavioral History</i></a>.  Informal talk at CWRU's Network Chat, April
  2005.
</ul>

<p>

Also see the <a href="http://www.ccied.org/">CCIED</a> center's web pages.

<p>
(Posted: Mon May 23, 2005; Updated: Mon Jul 21, 2008)
]]>
</content>
</description>
<pubDate>Mon Jul 21 13:54:41 EDT 2008
</pubDate>
</item>
<item>
<title>Increasing TCP's Initial Congestion Window</title>
<link>http://www.icir.org/mallman/research/proj-initwin.html</link>
<guid isPermaLink="false">1123771890</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Increasing TCP's Initial Congestion Window</b>
<p>
With several collaborators I have been investigating the impact of using a 
larger initial congestion window in TCP for some time now.  The proposal
is now a standards track RFC.  Some pointers to our work:
<p>
<ul>
<li>Mark Allman, Sally Floyd, Craig Partridge.
<i><a href="/mallman/papers/rfc3390.txt">
Increasing TCP's Initial Window</i></a>, October 2002.  RFC 3390.  
Status: Proposed Standard.
<p>
<li>Mark Allman.
<i><a href="/mallman/papers/webobs-ccr.ps">
A Web Server's View of the Transport Layer</a></i>.  ACM Computer 
Communication Review, 30(5), October 2000.
<p>
<li>Mark Allman, Sally Floyd, Craig Partridge. 
<i><a href="/mallman/papers/rfc2414.txt">
Increasing TCP's Initial Window</a></i>, September 1998.  RFC 2414. 
Status: Obsoleted by RFC 3390.
<p>
<li>Mark Allman, Chris Hayes, Shawn Ostermann.  <i><a
href="/mallman/papers/initwin-ccr.ps">An Evaluation of TCP with Larger Initial
Windows</a></i>.  ACM Computer Communication Review, 28(3), July
1998.
<p>
<li>Mark Allman.
<a href="/mallman/papers/ms-thesis.ps">
<i>Improving TCP Performance Over Satellite
Channels</i></a>. Master's Thesis, Ohio University, June 1997. 
</ul>
<p>
(Posted: Fri Oct 25, 2002)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:51:30 EDT 2005
</pubDate>
</item>
<item>
<title>Jump Start</title>
<link>http://www.icir.org/mallman/research/proj-js.html</link>
<guid isPermaLink="false">1192451144</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Jump Start</b>
<p>
We are considering the notion that congestion control does not require a
startup phase (ala traditional slow start).
<p>
<b>People</b>
<ul>
<li><a href="http://www.icir.org/mallman/">Mark Allman</a>
<li><a href="http://vorlon.case.edu/~dxl77/">Dan Liu</a>
<li><a href="http://vorlon.case.edu/~sxj63/">Shudong Jin</a>
<li>Limin Wang
</ul>
<p>
<b>Papers</b>
<ul>
<li>Dan Liu.  <a href="2007/liu-ms-thesis.pdf">
  Improving Start-Up and Steady-State Behavior of TCP in High 
  Bandwidth-Delay Product Networks</a></i>.  Master's Thesis,
  Case Western Reserve University, August 2007.
<p>
<li>Dan Liu, Mark Allman, Shudong Jin, Limin Wang.  
  <a href="/mallman/papers/jumpstart-pfldnet07.pdf"><i>
  Congestion Control Without a Startup Phase</a></i>.  Protocols
  for Fast, Long Distance Networks Workshop, February 2007.  Shudong's
  slides are <a href="2007/jins-pfldnet07.pdf">here</a>.
</ul>
<p>
<b>Talks</b>
<ul>
<li>Dan Liu, Mark Allman, Shudong Jin, Limin Wang.
  <i><a href="/mallman/talks/js-neonet06.pdf">
  Rethinking Startup in Congestion Control</a></i>.  Northeast Ohio
  Networking Workshop, March 2006.
  <a href="2006/js-neonet-abstract.txt">Abstract</a>.
</ul>
<p>
This is related to the Quick-Start work, which is focused on faster 
startup with the consent of all the nodes along the path.  Work on that
front can be found <a href="proj-quickstart.html">here</a>.
<p>
(Posted: Tue Dec 12, 2006; Updated: Wed Feb  7, 2007)
]]>
</content>
</description>
<pubDate>Mon Oct 15 08:25:44 EDT 2007
</pubDate>
</item>
<item>
<title>Internet Measurement</title>
<link>http://www.icir.org/mallman/research/proj-meas.html</link>
<guid isPermaLink="false">1216662638</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Internet Measurement</b>
<p>
One of my activities is to develop techniques to measure (and, hopefully
better understand) networks.  
<p>

<b>Papers:</b>

<ul>
<li>Mark Allman, Vern Paxson.
  <a href="/mallman/papers/rem-overview-pam08.pdf">
  <i>A Reactive Measurement Framework</i></a>.  Passive and Active
  Measurement Conference, April 2008.
<p>
<li>Mark Allman, Lann Martin, Michael Rabinovich, Kenneth
  Atchinson.
  <a href="/mallman/papers/open-meas-pam08.pdf">
  <i>On Community-Oriented Internet Measurement</i></a>.  Passive
  and Active Measurement Conference, April 2008.
<p>
<li>Mark Allman, Vern Paxson, Jeff Terrell.  
  <a href="/mallman/papers/scan-history-imc07.pdf">
  <i>A Brief History of Scanning</i></a>.  ACM SIGCOMM/USENIX Internet 
  Measurement Conference, October 2007.
<p>
<li>
  Mark Allman, Paul Barford, Balachander Krishnamurthy, Jia Wang.
  <a href="secmeas-sruti06.pdf"><i>Tracking the Role of Adversaries in 
  Measuring Unwanted Traffic</i></a>.  Workshop on Steps to Reduce Unwanted 
  Traffic on the Internet (SRUTI), July 2006.
<p>
<li>Alberto Medina, Mark Allman, Sally Floyd.
  <i><a href="/mallman/papers/tcp-evo-ccr05.ps">
  Measuring the Evolution of Transport Protocols in the Internet</a></i>.
  ACM Computer Communication Review, 35(2), April 2005.
<p>
<li>Alberto Medina, Mark Allman, Sally Floyd.
<i><a href="/mallman/papers/tcp-evo-imc04.ps">
Measuring Interactions Between Transport Protocols and Middleboxes</a></i>.
ACM SIGCOMM/USENIX Internet Measurement Conference, Taormina, Sicily, Italy,
October 2004.  To appear.
<p>
<li>Mark Allman, Wesley Eddy, Shawn Ostermann.
<i><a href="/mallman/papers/least-per-dec2003.ps">Estimating Loss Rates With 
TCP</a></i>.  ACM Performance Evaluation Review, 31(3), December 2003.
<p>
<li>Mark Allman.  
<i><a href="/mallman/papers/fwmeas-imc03.ps">On the Performance of 
Middleboxes</a></i>.  ACM SIGCOMM/Usenix Internet Measurement Conference, 
Miami, FL, USA, October 2003.
<p>
<li>Mark Allman.
<i><a href="/mallman/papers/btc-imw01.ps">
Measuring End-to-End Bulk Transfer Capacity</i></a>.  ACM SIGCOMM Internet 
Measurement Workshop.  November 2001.  Presentation slides also
<a href="/mallman/papers/imw01-btc-talk.ps">available</a>.
</ul>
<p>

<b>Other References:</b>

<ul>
<li>The <a href="http://www.icir.org/tbit/">TCP Behavior Inference Tool 
	  web page</a>.
</ul>

<p>

In addition to Internet measurement I have also been working on measuring
enterprise networks.  There is a 
<a href="/mallman/research/proj-enterprise.html">seperate page</a> covering
those activities.

<p>
(Posted: Wed Jun 11, 2003; Updated: Mon Jul 21, 2008)
]]>
</content>
</description>
<pubDate>Mon Jul 21 13:50:38 EDT 2008
</pubDate>
</item>
<item>
<title>Opportunistic Personas</title>
<link>http://www.icir.org/mallman/research/proj-personas.html</link>
<guid isPermaLink="false">1186598744</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Opportunistic Personas</b>
<p>
We have started to think in terms of informal crytpo and loosening the
way we think about coupling authentication and identity.  By doing this
we believe we can achieve better security in a number of cases, even if
not ideal security.
<p>
<b>Papers:</b>
<ul>
<li>Mark Allman, Christian Kreibich, Vern Paxson, Robin Sommer,
  Nicholas Weaver.  
  <a href="/mallman/papers/opp-personas-hotsec07.pdf">
  <i>The Strengths of Weaker Identities: Opportunistic Personas</i></a>.  
  USENIX Workshop on Hot Topics in Security (HotSec), August 2007.  
  Talk slides
  <a href="/mallman/papers/opp-personas-hotsec07-talk.pdf">available</a>.
</ul>
<p>
(Posted: Wed Aug 08, 2007; Updated: Wed Aug 08, 2007)
]]>
</content>
</description>
<pubDate>Wed Aug  8 14:45:44 EDT 2007
</pubDate>
</item>
<item>
<title>Personal Namespaces</title>
<link>http://www.icir.org/mallman/research/proj-pnames.html</link>
<guid isPermaLink="false">1195591019</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<p>
<b>Personal Namespaces</b>
<p>
This project involves developing an over-arching naming system for the
Internet that provides an indirection layer to current naming schemes.
Each person could then have their own namespace to populate (or, multiple
namespaces for multiple purposes).
<p>
<b>Papers</b>
<ul>
<li>Mark Allman.  
  <a href="/mallman/papers/pnames-hotnets07.pdf">
  <i>Personal Namespaces</i></a>.  ACM HotNets, November 2007.
  Slides
  <a href="/mallman/papers/pnames-hotnets07-talk.pdf">available</a>.
</ul>
<p>
(Posted: Tue Nov 20, 2007; Updated: Tue Oct 23, 2007)
]]>
</content>
</description>
<pubDate>Tue Nov 20 15:36:59 EST 2007
</pubDate>
</item>
<item>
<title>Quick-Start</title>
<link>http://www.icir.org/mallman/research/proj-quickstart.html</link>
<guid isPermaLink="false">1172842236</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Quick-Start</b>
<p>

With <a href="http://www.icir.org/floyd/">Sally Floyd</a>, Amit Jain and
<a href="http://www.cs.helsinki.fi/u/sarolaht/">Pasi Sarolahti</a> I am 
working on a method to make TCP startup more rapidly (with the consent
of the nodes on the path).

<p>

<b>Papers:</b>
<ul>
  <li>Pasi Sarolahti, Mark Allman, Sally Floyd.
    <a href="/mallman/papers/qs-comnet.pdf"><i>Determining an Appropriate 
    Sending Rate
    Over an Underutilized Network Path</a></i>.  Computer Networks Special
    Issue on Protocols for Fast, Long-Distance Networks, 51(7), May 2007.
  <p>
  <li>Sally Floyd, Mark Allman, Amit Jain, Pasi Sarolahti.
    <i><a href="mallman/papers/rfc4782.txt">Quick-Start for TCP and 
    IP</a></i>, January 2007.  RFC 4782.
</ul>

<p>

More information and references can be found on the Quick-Start 
<a href="http://www.icir.org/floyd/quickstart.html">web page</a>.

<p>

Also, this work is related to the Jump Start work, which takes the 
approach of wondering whether a startup phase is needed at all.  That 
work can be found <a href="proj-js.html">here</a>.

<p>
(Posted: Thu May 26, 2005; Updated: Sat Jan 27, 2007)
]]>
</content>
</description>
<pubDate>Fri Mar  2 08:30:36 EST 2007
</pubDate>
</item>
<item>
<title>Assessing RED's Biases</title>
<link>http://www.icir.org/mallman/research/proj-redbias.html</link>
<guid isPermaLink="false">1123771909</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Assessing RED's Biases</b>
<p>
<a href="http://irg.cs.ohiou.edu/~weddy/">Wes Eddy</a> (Ohio University) 
and I have been working on quantifying the biases in RED queueing that 
occur depending on the units used to calculate the queue size and the 
marking probability (whether in terms of packets or in terms of the size 
of the packets).
<p>
At <a href="http://www.acm.org/sigcomm/sigcomm2002/">SIGCOMM 2002</a>
Wes presented a poster detailing our work comparing RED byte and packet 
modes:
<p>
  <ul>
    <li>The <a href="/mallman/research/2002/redmodes-abstract.pdf">
      abstract</a> of the 
      poster was given to attendees. <br>
      The abstract also appears in ACM Computer Communication Review, 
      July 2002. 
    <li>Also, the poster is available 
      <a href="/mallman/research/2002/redmodes-poster.ps">here</a>.
    <li>Wes' pitch from SIGCOMM was videotaped and is available
      <a href="http://www-2.cs.cmu.edu/~ESM-streaming/broadcast_archive/sigcomm2002/index.html#poster">
	here</a>.
  </ul>
</ul>
<p>
A paper detailing our results:

<ul>
<li>Wesley Eddy, Mark Allman.
<i><a href="/mallman/papers/redbias.ps">
A Comparison of RED's Byte and Packet Modes</i></a>.  Computer Networks,
42(2), June 2003.
</ul>

<p>
(Posted: Mon Aug 26, 2002; Updated: Mon Apr 28, 2003)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:51:49 EDT 2005
</pubDate>
</item>
<item>
<title>Making TCP Robust to Packet Reordering</title>
<link>http://www.icir.org/mallman/research/proj-reorder.html</link>
<guid isPermaLink="false">1157165524</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Making TCP Robust to Packet Reordering</b>
<p>
Several colleagues and I are thinking about new ways to make TCP robust 
to packet reordering in networks.

<p>

<b>People:</b> 
  <a href="http://www.cs.purdue.edu/homes/eblanton/">Ethan Blanton</a>,
  <a href="http://students.cs.tamu.edu/sumitha/">Sumitha Bhandarkar</a>,
  <a href="http://ee.tamu.edu/~reddy/">A. L. Narasimha Reddy</a>

<p>

<b>Papers</b>

<ul>
<li>Sumitha Bhandarkar, A. L. Narasimha Reddy, Mark Allman, Ethan
  Blanton. <a href="/mallman/papers/rfc4653.txt">
  <i>Improving the Robustness of TCP to Non-Congestion Events</i></a>,
  August 2006.  RFC 4653.
<p>
<li>Ethan Blanton, Robert Dimond, Mark Allman.
  <i><a href="/mallman/papers/draft-blanton-tcp-reordering-00.txt">
  Practices for TCP Senders in the Face of Segment Reordering</i></a>,
  February 2003.  Internet-Draft draft-blanton-tcp-reordering-00.txt (work 
  in progress).
<p>
<li>Ethan Blanton, Mark Allman.
  <i><a href="/mallman/papers/tcp-reorder-ccr.ps">
  On Making TCP More Robust to Packet Reordering</i></a>.  ACM Computer 
  Communication Review, 32(1), January 2002.
</ul>

<p>

<b>Talks</b>

<ul>
<li>Mark Allman.  <i>On Packet Reordering and TCP Performance</i>.
  NASA GRC 5610 Research Retreat.  May 2002.  Slides
  <a href="/mallman/talks/reorder-5610retreat-may02.ps">available</a>.
</ul>

<p>

(Posted: Tue Sep 24, 2002; Updated: Fri Sep  1, 2006)
]]>
</content>
</description>
<pubDate>Fri Sep  1 22:52:04 EDT 2006
</pubDate>
</item>
<item>
<title>Reducing RTOs in TCP</title>
<link>http://www.icir.org/mallman/research/proj-rtoreduce.html</link>
<guid isPermaLink="false">1222876063</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Reducing RTOs in TCP</b>
<p>
We have been working on evaluating and designing mechanisms that will 
reduce TCP's reliance on the retransmission timer for repairing segment 
loss, as well as correcting the RTO estimate when it fails.  A few 
references:
<p>
<h3>Papers</h3>
<ul>
<li>Josh Blanton, Ethan Blanton, Mark Allman.  <i>
  <a href="/mallman/papers/backoff-tr-08-005.pdf">Using Spurious 
  Retransmissions to Adapt the Retransmission Timeout</a></i>.  Technical 
  Report 08-005, International Computer Science Institute, August 2008.
<p>
<li>Mark Allman, Konstantin Avrachenkov, Urtzi Ayesta, Josh Blanton,
 Per Hurtig.
 <i><a href="/mallman/papers/draft-ietf-tcpm-early-rexmt-00.txt">
 Early Retransmit for TCP and SCTP</a></i>, August 2008.
 Internet-Draft draft-ietf-tcpm-early-rexmt-00.txt (work in progress).
<ul>
<li><a href="/mallman/research/2007/er-ietf69.pdf">Status report presented
at IETF 69, July 2007.
<li><a href="/mallman/research/2003/er-ietf56.pdf">Status report presented 
at IETF 56, March 2003.</a>
</ul>
<p>
<li>Mark Allman, Hari Balakrishnan, Sally Floyd.  
<a href="/mallman/papers/rfc3042.txt"><i>
Enhancing TCP's Loss Recovery Using Limited Transmit</a></i>, January 2001.  
RFC 3042.
</ul>
<p>
<h3>Talks</h3>
<ul>
<li>Josh Blanton.  Comparing RTO Reduction Algorithms in TCP, NASA Glenn
  Research Center, August 2003.  
  <a href="/mallman/research/2003/jtb-grc-rtoreduce-talk.ps">Slides</a>.
</ul>
<p>
(Posted: Mon Feb 24, 2003; Updated: Wed Oct  1, 2008)
]]>
</content>
</description>
<pubDate>Wed Oct  1 11:47:43 EDT 2008
</pubDate>
</item>
<item>
<title>Use of TCP SACK Information</title>
<link>http://www.icir.org/mallman/research/proj-sack.html</link>
<guid isPermaLink="false">1123771937</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Use of TCP SACK Information</b>
<p>
With a few collaborators I have been working on specifying the use of 
SACK and DSACK information.
<p>
Documents:
<p>
<ul>
<li>Ethan Blanton, Mark Allman.
<i><a href="/mallman/papers/rfc3708.txt">
Using TCP Duplicate Selective Acknowledgement (DSACKs) and Stream 
Control Transmission Protocol (SCTP) Duplicate Transmission Sequence 
Numbers (TSNs) to Detect Spurious Retransmissions</a></i>, February 2004.
RFC 3708.
<p>
<li>Ethan Blanton, Mark Allman, Kevin Fall, Lili Wang.
<i><a href="/mallman/papers/rfc3517.txt">A Conservative Selective 
Acknowledgment 
(SACK)-based Loss Recovery Algorithm for TCP</a></i>, April 2003.  RFC 3517.
</ul>
<p>
Talks:
<p>
<ul>
<li>Mark Allman.  
<a href="/mallman/research/2002/sack-dsack-status-ietf55.pdf">Status 
report</a> given at TSV-WG meeting, IETF-55 Atlanta, GA.
</ul>
<p>
(Posted: Sun Oct 20, 2002; Updated: Tue Feb 24, 2004)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:52:17 EDT 2005
</pubDate>
</item>
<item>
<title>Sharing Internet Measurement Data</title>
<link>http://www.icir.org/mallman/research/proj-simr.html</link>
<guid isPermaLink="false">1216662677</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Sharing Internet Measurement Data</b>
<p>
With a number of collaborators I have been thinking about ways in which 
Internet measurement data can be shared among the community in a sane way, 
as well as actually taking some concrete steps and releasing some data.

<p>

<b>Papers</b>

<ul>
<li>Mark Allman, Lann Martin, Michael Rabinovich, Kenneth
  Atchinson.
  <a href="/papers/open-meas-pam08.pdf">
  <i>On Community-Oriented Internet Measurement</i></a>.  Passive
  and Active Measurement Conference, April 2008.
<p>

<li>Mark Allman, Vern Paxson.
  <a href="/mallman/papers/etiquette-imc07.pdf">
  <i>Issues and Etiquette Concerning Use of Shared Measurement
    Data</i></a>.  ACM SIGCOMM/USENIX Internet Measurement Conference,
  October 2007.
  Talk slides
  <a href="/mallman/papers/etiquette-imc07-talk.pdf">available</a>.
<p>

<li>
  Ruoming Pang, Mark Allman, Vern Paxson, Jason Lee.  
  <a href="/mallman/papers/devil-ccr-jan06.pdf"><i>The Devil and Packet Trace 
  Anonymization</i></a>.  ACM Computer Communication Review, 36(1), 
  January 2006.
  The public review of this paper is avalable
  <a href="/mallman/papers/devil-ccr-jan06-pubrev.pdf">here</a>.

<p>

<li>Mark Allman, Ethan Blanton, Wesley Eddy. 
<i><a href="/mallman/papers/simr-pam2002.ps">
A Scalable System for Sharing Internet Measurements</a></i>.  Proceedings of
the Passive and Active Measurement Workshop, March 2002.
</ul>

<p>

<b>Workshop Reports</b>

<ul>
  <li>kc claffy, Mark Crovella, Timur Friedman, Colleen Shannon, 
    Neil Spring.
    <a href="2005/conmi-workshop2005.pdf">
    <i>Community-Oriented Network Measurement Infrastructure (CONMI) 
      Workshop Report</i></a>, 2005.
</ul>

<p>

<b>Talks</b>

<ul>
  <li>Mark Allman.
    <i><a href="/mallman/talks/imdc-culture-jun2004.pdf">
	 How Do We Build a Culture That Values Data Catalogs?</a></i>.
    CAIDA Internet Measurement Data Catalog Workshop, June 2004.
  <p>
  <li>Ethan Blanton.
    <i><a href="/mallman/research/2004/elb-imdc-metadata-jun2004.pdf">
	 SIMR: Collecting Useful Meta-Data</a></i>.
    CAIDA Internet Measurement Data Catalog Workshop, June 2004.
</ul>

<p>

<b>Data</b>

<ul>
  <li>As part of the <a href="http://www.icir.org/enterprise-tracing/">
    LBNL/ICSI tracing project</a> we have released 11GB of anonymized
    packet headers from over 100 hours of tracing a medium size 
    enterprise network.
</ul>

<p>

(Posted: Mon Jun  7, 2004; Updated: Mon Jul 21, 2008)
]]>
</content>
</description>
<pubDate>Mon Jul 21 13:51:17 EDT 2008
</pubDate>
</item>
<item>
<title>Urban Sensing Systems</title>
<link>http://www.icir.org/mallman/research/proj-urban.html</link>
<guid isPermaLink="false">1165937867</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Urban Sensing Systems</b>
<p>
With UCLA we have started working on the topic of personal, social and 
urban-scale sensing applications.
<p>
<b>Papers:</b>
<ul>
<li>Andrew Parker, Sasank Reddy, Thomas Schmidt, Kevin Chang, Ganeriwal 
  Saurabh, Mani Srivastava, Mark Hansen, Jeff Burke, Deborah Estrin,
  Mark Allman, Vern Paxson.  
  <a href="/mallman/papers/urban-sensing-hotnets06.pdf">
  <i>Network System Challenges in Selective Sharing and Verification 
  for Personal, Social, and Urban-Scale Sensing Applications</i></a>.  ACM 
  SIGCOMM HotNets, November 2006.
  Public review
  <a href="/mallman/papers/urban-sensing-hotnets06-pubrev.pdf">
  available</a>.
<p>
<li>Mani Srivastava, Mark Hansen, Jeff Burke, Andrew Parker, Sasank 
  Reddy, Ganeriwal Saurabh, Mark Allman, Vern Paxson, Deborah Estrin.  
  <a href="/mallman/papers/urban-sensing-ucla-tr65.pdf">
  <i>Wireless Urban Sensing Systems</i></a>.  CENS Technical Report
  #65, University of California, Los Angeles, April 2006.
</ul>
<p>
Also see the project's web page 
<a href="http://research.cens.ucla.edu/projects/2006/Systems/Urban_Sensing/default.htm">
here</a>.
<p>
(Posted: Tue Dec 12, 2006; Updated: Tue Dec 12, 2006)
]]>
</content>
</description>
<pubDate>Tue Dec 12 10:37:47 EST 2006
</pubDate>
</item>
<item>
<title>Evaluating XML-RPC</title>
<link>http://www.icir.org/mallman/research/proj-xmlrpc.html</link>
<guid isPermaLink="false">1123771917</guid>
<description>
<content type="text/html" mode="escaped" xml:lang="en">
<![CDATA[
<b>Evaluating XML-RPC</b>
<p>
I have been looking at XML-RPC from various angles (performance, coding
complexity, etc.).  In general, I think it would be quite nice if more
folks looked at systems like this from more angles (so, programming
languages folks, networking folks, etc.).  References:
<p>
<ul>
<li>Mark Allman.
<i><a href="/mallman/papers/xmlrpc-perf.ps">
An Evaluation of XML-RPC</i></a>.  ACM Performance Evaluation Review, 
30(4), March 2003.
<p>
<li>The <a href="http://www.xml-rpc.org">XML-RPC web page</a>
</ul>
<p>
(Posted: Wed Nov  6, 2002; Updated: Mon Apr 28, 2003)
]]>
</content>
</description>
<pubDate>Thu Aug 11 10:51:57 EDT 2005
</pubDate>
</item>
</channel>
</rss>
