Back to Results
First PageMeta Content



Competitive FIB Aggregation without Update Churn Marcin Bienkowski University of Wrocław Wrocław, Poland
Add to Reading List

Document Date: 2014-04-14 13:16:09


Open Document

File Size: 266,64 KB

Share Result on Facebook

City

Berlin / /

Company

LG / Cambridge University Press / Autonomous Systems / Gi / Morgan Kaufmann Publishers Inc. / Cisco / H I M S a / Software-Defined Networks / Hp / IEEE Journal / /

Country

United States / Canada / /

/

Facility

Steve Uhlig Queen Mary University / Update Churn Marcin Bienkowski University of Wrocław Wrocław / /

IndustryTerm

Online Computation / offline algorithms / left / offline algorithm / online variant / Internet core routers / stick-based algorithms / online analysis / virtual networks / Internet Exchange Point / dynamic programming algorithm / study algorithms / Internet router / local solution / classic online aggregation problems / possible long-term solutions / polynomial time algorithm / natural and local solution / campus networks / online algorithm / packet forwarding router / route processor / virtual routers / online algorithms / aggregation algorithms / internet address space deaggregation / /

OperatingSystem

L3 / /

Organization

Cambridge University / Mary University London / Update Churn Marcin Bienkowski University of Wrocław Wrocław / FIFA / PT’s FIB / Polish National Science Centre / /

Person

B. D. Zill / Aman Shaikh / Stefan Schmid / C. King / S. Venkatachary / J. E. van der Merwe / Fred Baker / R. P. Draves / /

Position

network-attached SDN controller / SDN controller / controller / King / /

Technology

online algorithm / IPv6 / two routers / Internet router / polynomial time algorithm / aggregation algorithms / study algorithms / stick-based algorithm / packet forwarding router / route processor / so-called stick-based algorithms / ISP / dynamic programming algorithm / IPv4 / /

URL

http /

SocialTag