====BT: Hi David, I'd appreciate to have a 10-15 mn slot to present 6DISS a new european project started last April 1st. Thanx & cheers, +Bernard T. --- David Kessens wrote:
Hi,
Please see below for the draft agenda (v1) of the ipv6 working group.
This is the first version of the agenda so we are still looking for agenda topics and contributions for the various standard sections of the agenda. Please let me know if there is anything that you would like to discuss.
I would also like to draw your attention to the plenary part of the meeting that has various interesting ipv6 presentations on the agenda (see below).
David Kessens ---
Draft Agenda (v1) for the IPv6 Working Group Meeting RIPE51
When: Wednesday, October 12, 2005, 17:00-18:00 Where: Grand Ballroom, Hotel Krasnapolsky, Amsterdam
A. Administrative stuff - appointment of scribe - agenda bashing (David Kessens)
B. Quick update from the RIPE NCC regarding ipv6 services (RIPE NCC)
C. Discussion on: Global IPv6 routing table status (Gert Doering)
D. Report(s) about *actual* v6 traffic volume as compared to v4? *what's real* out there, not what's on powerpoint? (input from the audience)
E. Developments/initiatives regarding IPv6 in the RIPE region and beyond (input from the audience)
F. Input for the RIPE NCC Activity Plan (input from the audience)
Z. AOB ---
Interesting topics in the plenary section:
TUESDAY 09:00 - 10:30
6. IPv6 Routing Update. Gert Doering. Spacenet (20 min)
Update on observations on the state of the IPv6 default free routing table.
7. IPv6 Multihoming Status. Kurtis Lindqvist. Netnod (30 min)
An up-to-date status report on the progress towards scalable IPv6 multihoming.
8. IPv6 Address Allocation --An Alternative Algorithm for the Sparse Allocation Process. Mae Wang (30 min)
IP address allocation policies significantly impact the Internet infrastructure, affecting many parties such as router manufacturers, ISPs, and end users. An address allocation policy can also directly affect the performance of the Internet.
For example, address fragmentation, a key problem in IPv4, degrades address lookup performance in routers. Thus, a well-designed address allocation policy needs to minimise fragmentation while using the address space efficiently.
This paper attempts to quantify the performance of address allocation policies by modelling key features that lead to fragmentation and inefficient address space usage.
Our main contributions are: (i) we identify a drawback of the current IPv6 address allocation policy, which treats all entities uniformly, (ii) we propose a scheme that takes future growth rate into account for allocations, and (iii) an analytical model for measuring the efficiency of allocation schemes, allowing us to quantify the improvement our proposal offers over the current scheme. We believe that a quantitative study of allocation policies is timely since IPv6 address allocation is just beginning in earnest.
------