Internet transmission and switching facilities are partitioned into di
fferent administrative domains, To effect data exchange between domain
s, domain border routers usually establish pairwise peering sessions a
nd exchange routes at exchange points, At some exchange points, border
routers peer with a route server instead, The route server computes a
set of routes on behalf of each of its client border routers, A route
server implementation that maintains a separate table of routes for e
ach client can be memory intensive; the worst-case route storage requi
rement of such an implementation is more than 650 MB in some configura
tions. We describe optimizations that trade-off route server route pro
cessing for an order of magnitude reduction in route storage requireme
nts.