<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="https://drupalinl.info.ucl.ac.be" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>Damien Saucez&#039;s blog</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/dsaucez</link>
 <description></description>
 <language>en</language>
<item>
 <title>LISP Tutorials</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/10-03-31-lisp-tutorial</link>
 <description>&lt;p&gt;The Locator/Identifier Separation Protocol (LISP) is a proposal aiming at resolving some problem the Internet is facing today like the lack of inbound inter-domain traffic engineering or the continuous growth of the routing table.&lt;/p&gt;
&lt;p&gt;The tutorials available on &lt;a href=&quot;http://inl.info.ucl.ac.be/tutorials/lisp-tutorial&quot; title=&quot;http://inl.info.ucl.ac.be/tutorials/lisp-tutorial&quot;&gt;http://inl.info.ucl.ac.be/tutorials/lisp-tutorial&lt;/a&gt; present LISP today&lt;/p&gt;
</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/10-03-31-lisp-tutorial#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/lisp">LISP</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/lisp-alt-0">LISP+ALT</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/tutorial">tutorial</category>
 <pubDate>Wed, 31 Mar 2010 07:38:52 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">717 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>Network radix lookup</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/10-02-27-network-radix-lookup</link>
 <description>&lt;p&gt;You frequently need to resolve IP addresses into their longest-match prefix? RADIX_UDP is for you ;-)&lt;/p&gt;
&lt;p&gt;The tool loads a list of prefixes into a radix that can be queried in UDP. The syntax is simple, send a UDP segment in text with the first column being the IP, we don&#039;t care about the others ;-)&lt;/p&gt;
&lt;p&gt;The server will reply with the same text but with the corresponding prefix prepended.&lt;/p&gt;
&lt;p&gt;Example,&lt;/p&gt;
&lt;p&gt;create a file &quot;prefix.dat&quot; with this content:&lt;/p&gt;
&lt;pre&gt;
192.0.2.0/24
192.0.2.128/25
&lt;/pre&gt;&lt;p&gt;
start the server:&lt;/p&gt;
&lt;pre&gt;
./radix_udp prefix.dat 45005
&lt;/pre&gt;&lt;p&gt;
query it&lt;/p&gt;
</description>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/radix-server">radix server</category>
 <enclosure url="https://drupalinl.info.ucl.ac.be/system/files/radix_udp.tar.gz" length="6998" type="application/octet-stream" />
 <pubDate>Sat, 27 Feb 2010 05:54:19 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">707 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/09-02-04-characteristics-destination-address-locality-computer-networks-comparison-caching-schemes</link>
 <description>&lt;p&gt;“Characteristics of Destination Address Locality in Computer Networks: A Compar-&lt;br /&gt;
ison of Caching Schemes,” R. Jain, Computer Networks and ISDN, vol. 18, pp. 243–254, 1989/1990.&lt;/p&gt;
&lt;p&gt;This paper is probably the first to think about locality in network traffic. At that time, most of the networks were built on pure proprietary architectures, however, some of the conclusions are still applicable today. However, as the analysis was performed on non IP networks, we&#039;ll not discuss the experimental part in this summary.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/09-02-04-characteristics-destination-address-locality-computer-networks-comparison-caching-schemes&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/09-02-04-characteristics-destination-address-locality-computer-networks-comparison-caching-schemes#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/cache-algorithm">cache algorithm</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/network">network</category>
 <pubDate>Wed, 04 Feb 2009 21:40:07 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">552 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>draft-fuller-list-alt</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-06-11-draft-fuller-list-alt-01</link>
 <description>&lt;p&gt;The Farinacci et al. &quot;LISP Alternative Topology (LISP-ALT)&quot; draft proposes a mechanism to manage EID to RLOCs mapping in the LISP protocol.&lt;/p&gt;
&lt;p&gt;The idea of LISP-ALT (ALT for Alternative Topology) propose to build an public Internet overlay to manage mapping in LISP.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-06-11-draft-fuller-list-alt-01&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/ebgp">eBGP</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/farinacci">Farinacci</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/fuller">Fuller</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/lisp">LISP</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/lisp-alt">LISP-ALT</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/meyer">Meyer</category>
 <pubDate>Wed, 11 Jun 2008 12:19:12 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">473 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>Client-Side Adaptive Search Optimisation for Online Game Server Discovery</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-05-06-client-side-adaptive-search-optimisation-online-game-server-discovery</link>
 <description>&lt;p&gt;The paper &quot;Client-Side Adaptive Search Optimisation for Online Game Server Discovery&quot; presented at Networking&#039;08 and written by G. Armitage aims at reducing response time and resources consumption of server selection in online games.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-05-06-client-side-adaptive-search-optimisation-online-game-server-discovery&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/08-05-06-client-side-adaptive-search-optimisation-online-game-server-discovery#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/armitage">Armitage</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/discovery">discovery</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/game">Game</category>
 <pubDate>Tue, 06 May 2008 21:01:33 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">460 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>Turbo King: Framework for Large-Scale Internet Delay Measurements</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-04-23-turbo-king-framework-large-scale-internet-delay-measurements</link>
 <description>&lt;p&gt;The paper &quot;Turbo King: Framework for Large-Scale Internet Delay Measurements&quot; published by Leonard and Loguinov at INFOCOM&#039;08 shows the inaccuracies of the King delay estimation framework and propose Turbo King to tackle the problem.&lt;/p&gt;
&lt;p&gt;The idea of King is to estimate distance between any to nodes by measuring the time required to resolve a DNS query from a DNS server near the source and a DNS server near the destination.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-04-23-turbo-king-framework-large-scale-internet-delay-measurements&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/08-04-23-turbo-king-framework-large-scale-internet-delay-measurements#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/delay">delay</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/king">King</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/large-scale">large-scale</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/leonard">Leonard</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/loguinov">Loguinov</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/measurements">measurements</category>
 <pubDate>Wed, 23 Apr 2008 09:37:01 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">457 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>Minerva: Learning to Infer Network Path Properties</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-04-22-minerva-learning-infer-network-path-properties</link>
 <description>&lt;p&gt;The INFOCOM&#039;08 paper titled &quot;Minerva: Learning to Infer Network Path Properties&quot; written by Wouhaybi et al. proposes to predict network path properties based on learning techniques.&lt;/p&gt;
&lt;p&gt;This last decade, plenty of solutions have been proposed to estimate the path properties between nodes without having to explicitly measure the path between the two nodes. However, most of the techniques (with or without landmarks) require to periodically make some measurements.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-04-22-minerva-learning-infer-network-path-properties&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/08-04-22-minerva-learning-infer-network-path-properties#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/banerjee">Banerjee</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/bayesian">bayesian</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/campbell">Campbell</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/minerva">minerva</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/path-properties">path properties</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/sharma">Sharma</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/wouhaybi">Wouhaybi</category>
 <pubDate>Tue, 22 Apr 2008 06:28:50 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">456 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>On Network-Aware Clustering of Web Clients</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-04-14-network-aware-clustering-web-clients</link>
 <description>&lt;p&gt;The paper &quot;On network-aware clustering of web clients&quot; presented at SIGCOMM ’00 by Krishnamurthy and Wang proposes clustering techniques to move content closer to the clients which are generating most of the traffic.&lt;/p&gt;
&lt;p&gt;Before the paper, cluster of clients were simply /24 networks. The authors propose to group clients by BGP prefixes.&lt;/p&gt;
&lt;p&gt;The paper is focused on web traffic and to determine the quality of the BGP clustering, the authors analyses web server logs. Based on the logs, they map client IP addresses to BGP prefixes.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-04-14-network-aware-clustering-web-clients&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/clustering">clustering</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/krishnamurthy">Krishnamurthy</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/network">network</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/wang">Wang</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/web">web</category>
 <pubDate>Mon, 14 Apr 2008 20:23:57 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">455 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>An Overview of Routing Optimization for Internet Traffic Engineering</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-04-08-overview-routing-optimization-internet-traffic-engineering</link>
 <description>&lt;p&gt;The paper &quot;An Overview of Routing Optimization for Internet Traffic Engineering&quot; presented by Wang et al. in IEEE Communications Surveys volume 10, N°1 presents a complete survey of the current techniques for traffic engineering.&lt;/p&gt;
&lt;p&gt;In this blog, we will not summary the survey, just present the structure.&lt;/p&gt;
&lt;p&gt;The paper divides TE according to four criteria.&lt;/p&gt;
&lt;p&gt;1. scope: interdomain vs intradomain&lt;br /&gt;
2. enforcement: MPLS-based vs IP-based&lt;br /&gt;
3. timescale: online vs offline&lt;br /&gt;
4. type: unicast vs multicast&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-04-08-overview-routing-optimization-internet-traffic-engineering&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <comments>https://drupalinl.info.ucl.ac.be/blogs/08-04-08-overview-routing-optimization-internet-traffic-engineering#comments</comments>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/hon-ho">Hon Ho</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/howarth">Howarth</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/overview">overview</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/pavlou">Pavlou</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/routing">routing</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/te">TE</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/wang">Wang</category>
 <pubDate>Tue, 08 Apr 2008 06:36:47 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">451 at https://drupalinl.info.ucl.ac.be</guid>
</item>
<item>
 <title>A Measurement-Based Analysis of Multihoming</title>
 <link>https://drupalinl.info.ucl.ac.be/blogs/08-04-01-measurement-based-analysis-multihoming</link>
 <description>&lt;p&gt;The paper &quot;A Measurement-Based Analysis of Multihoming&quot; proposed by Akella et al. at SIGCOMM&#039;03 shows different aspects of performances improvements in multihomed environments.&lt;/p&gt;
&lt;p&gt;The journal article we discussed in &lt;a href=&quot;http://inl.info.ucl.ac.be/blogs/08-03-17-performance-benefits-multihoming-route-control&quot;&gt;[08-03-17]&lt;/a&gt; is basically the same as this paper, so that we only present a fast summary of the paper.&lt;/p&gt;
&lt;p&gt;&lt;a href=&quot;https://drupalinl.info.ucl.ac.be/blogs/08-04-01-measurement-based-analysis-multihoming&quot;&gt;read more&lt;/a&gt;&lt;/p&gt;</description>
 <category domain="https://drupalinl.info.ucl.ac.be/category/visibility/public">Public</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/akella">Akella</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/measurement">measurement</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/multihoming">multihoming</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/shaikh">Shaikh</category>
 <category domain="https://drupalinl.info.ucl.ac.be/keywords/sitaraman">Sitaraman</category>
 <pubDate>Tue, 01 Apr 2008 16:47:53 +0000</pubDate>
 <dc:creator>dsaucez</dc:creator>
 <guid isPermaLink="false">448 at https://drupalinl.info.ucl.ac.be</guid>
</item>
</channel>
</rss>
