Public

warning: Creating default object from empty value in /var/www/obonet/modules/taxonomy/taxonomy.module on line 1418.

Computer Networking course : part 2 (Application layer)

Tue, 09/29/2009 - 11:01 by Olivier Bonaventure • Categories:

First part

Second part


Two new Internet topology datasets

Tue, 09/15/2009 - 12:42 by Olivier Bonaventure • Categories:

The research community has developed many tools to try to map the topology of the Internet. As the Internet is a decentralised network composed of more thank 30000 different networks, it is very difficult (and perhaps impossible) to obtain a detailed map of the network. The most widely use to infer the router-level topology of the Internet is traceroute.


Trilogy Future Internet Summer School

Sat, 09/12/2009 - 22:51 by Olivier Bonaventure • Categories:

The video recordings of the Trilogy Future Internet Summer School are available from http://inl.info.ucl.ac.be/TFISS09 .


RFC1149 faster than ADSL ?

Thu, 09/10/2009 - 19:41 by Olivier Bonaventure • Categories:

RFC1149 entitled IP over avian carriers is one of those RFCs that were published on April 1st. It describes a method to carry IP packets by using pigeons. RFC1149 was designed during the dialup era and packets were printed on sheets of papers before being attached to pigeons and a scanner was used by the recipient to recover the packet. Among all the April fools RFCs that have been written, RFC1149 is one of the few that has actually been implemented.


Compact Routing: Challenges, Perspectives, and Beyond

Wed, 09/09/2009 - 01:01 by Olivier Bonaventure • Categories:
Authors: 
Dimitri Papadimitriou
Place: 
Louvain-la-Neuve, Belgium
Language: 
English
Event: 
Trilogy Future Internet summer school

Abstract: Compact routing schemes were until recently considered as the main alternative to overcome the fundamental scaling limitations of the Internet routing system. Such schemes have been introduced to address the fundamental and unavoidable trade-off between the stretch of a routing scheme and the routing table size it produces. Recent studies have shown that static routing on topology-dependent identifiers (that includes "some" topological information) scales (poly)logarithmically on the number of nodes in scale-free graphs such as the Internet.


Syndicate content