[rrg] routing talks at the IRTF Open Meeting

Lars Eggert <lars.eggert@nokia.com> Mon, 25 July 2011 16:12 UTC

Return-Path: <lars.eggert@nokia.com>
X-Original-To: rrg@ietfa.amsl.com
Delivered-To: rrg@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id D7F0511E8187; Mon, 25 Jul 2011 09:12:36 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -102.712
X-Spam-Level:
X-Spam-Status: No, score=-102.712 tagged_above=-999 required=5 tests=[AWL=0.088, BAYES_00=-2.599, RCVD_IN_DNSWL_LOW=-1, SARE_SUB_RAND_LETTRS4=0.799, USER_IN_WHITELIST=-100]
Received: from mail.ietf.org ([64.170.98.30]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id es7hl83Ocub3; Mon, 25 Jul 2011 09:12:36 -0700 (PDT)
Received: from mgw-da01.nokia.com (smtp.nokia.com [147.243.128.24]) by ietfa.amsl.com (Postfix) with ESMTP id D172F21F86C0; Mon, 25 Jul 2011 07:56:27 -0700 (PDT)
Received: from mail.fit.nokia.com (esdhcp030222.research.nokia.com [172.21.30.222]) by mgw-da01.nokia.com (Switch-3.4.4/Switch-3.4.3) with ESMTP id p6PEuPgK006916 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Mon, 25 Jul 2011 17:56:27 +0300
From: Lars Eggert <lars.eggert@nokia.com>
X-Virus-Status: Clean
X-Virus-Scanned: clamav-milter 0.97.1 at fit.nokia.com
Mime-Version: 1.0 (Apple Message framework v1084)
Content-Type: multipart/signed; boundary="Apple-Mail-20-438612764"; protocol="application/pkcs7-signature"; micalg="sha1"
Date: Mon, 25 Jul 2011 10:56:18 -0400
References: <20EE70D9-061A-47D1-822B-9DB392931520@nokia.com>
To: routing-discussion@ietf.org
Message-Id: <A20258A0-4CCF-40F4-BA34-82A9B622CB4F@nokia.com>
X-Mailer: Apple Mail (2.1084)
X-Greylist: Sender succeeded SMTP AUTH, not delayed by milter-greylist-4.2.7 (mail.fit.nokia.com); Mon, 25 Jul 2011 17:56:21 +0300 (EEST)
X-Nokia-AV: Clean
Cc: rrg@irtf.org
Subject: [rrg] routing talks at the IRTF Open Meeting
X-BeenThere: rrg@irtf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: IRTF Routing Research Group <rrg.irtf.org>
List-Unsubscribe: <http://www.irtf.org/mailman/options/rrg>, <mailto:rrg-request@irtf.org?subject=unsubscribe>
List-Archive: <http://www.irtf.org/mail-archive/web/rrg>
List-Post: <mailto:rrg@irtf.org>
List-Help: <mailto:rrg-request@irtf.org?subject=help>
List-Subscribe: <http://www.irtf.org/mailman/listinfo/rrg>, <mailto:rrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Mon, 25 Jul 2011 16:12:37 -0000

Hi,

in the first hour of the IRTF Open Meeting Wednesday morning, there will be two talks by the ANRP awardees (see http://irtf.org/anrp) on topics that I hope are of interest to routing folks. FYI.

Lars

Begin forwarded message:
> Applied Networking Prize (ANRP) Awards
> 	2x 20+10 min
> 
> 	*** Beichuan Zhang *** for research into “green” traffic engineering:
> 	GreenTE: Power-Aware Traffic Engineering. Mingui Zhang,
> 	Cheng Yi, Bin Liu and Beichuan Zhang. Proc. IEEE International
> 	Conference on Network Protocols (ICNP), pp. 21–30, October 2010.
> 
> 	Abstract: Given the high path redundancy and low link
> 	utilization in today's large networks, one may route traffic
> 	using fewer number of links so that other links can go sleep
> 	to conserve energy. In this work we design a traffic engineering
> 	mechanism that maximizes the number of links to sleep under
> 	certain performance constraints such as link utilization and packet
> 	delay. Using network topologies and traffic data from several
> 	wide-area networks, our evaluation demonstrates that GreenTE is
> 	both feasible and beneficial.
> 
> 	*** Mattia Rossi *** for research into reducing BGP traffic:
> 
> 	A Technique for Reducing BGP Update Announcements through Path
> 	Exploration Damping. Geoff Huston, Mattia Rossi and Grenville
> 	Armitage. IEEE Journal on Selected Areas in Communications (JSAC),
> 	Vol. 28, No. 8, pp. 1271–1286, October 2010.
> 
> 	Abstract: Path Exploration Damping is intended as a replacement
> 	for MRAI and RFD, the two main mechanisms used in BGP that aim
> 	at a reduction of BGP update churn. This talk explains the
> 	motivation behind PED, outlines the algorithm and provides
> 	insight into experimental results.