TY - GEN
T1 - Speccast
AU - Poutievski, Leonid
AU - Calvert, Kenneth L.
AU - Griffioen, James N.
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2004
Y1 - 2004
N2 - In this paper we describe a new network service called Speccast. Spec-cast offers a generalized addressing and routing abstraction on which a rich variety of semantic services can be built, and, as such, provides a vehicle for studying the relationships among routing, addressing and topology. Unlike overlay-based systems, we study a more basic problem, in which the topology of the network is given, and there is not necessarily any pre-existing underlying network service. In the speccast model, each packet carries a destination predicate and the network's job is to deliver the packet to all nodes satisfying that predicate. After showing how this generalized routing service subsumes other services both traditional (unicast, multicast) and emerging (publish-subscribe), we present a layered solution for a specific class of simple predicates. We examine the tradeoffs in various forms of our approach, and compare it to existing solutions for unicast and multicast. Studies using transit-stub graphs show that our generic service performs comparably to existing solutions for traditional services, while also effectively supporting new and emerging services.
AB - In this paper we describe a new network service called Speccast. Spec-cast offers a generalized addressing and routing abstraction on which a rich variety of semantic services can be built, and, as such, provides a vehicle for studying the relationships among routing, addressing and topology. Unlike overlay-based systems, we study a more basic problem, in which the topology of the network is given, and there is not necessarily any pre-existing underlying network service. In the speccast model, each packet carries a destination predicate and the network's job is to deliver the packet to all nodes satisfying that predicate. After showing how this generalized routing service subsumes other services both traditional (unicast, multicast) and emerging (publish-subscribe), we present a layered solution for a specific class of simple predicates. We examine the tradeoffs in various forms of our approach, and compare it to existing solutions for unicast and multicast. Studies using transit-stub graphs show that our generic service performs comparably to existing solutions for traditional services, while also effectively supporting new and emerging services.
KW - Addressing and location management
KW - Network applications and services
KW - Routing
KW - Simulations
KW - System design
UR - http://www.scopus.com/inward/record.url?scp=8344269338&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8344269338&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2004.1354649
DO - 10.1109/INFCOM.2004.1354649
M3 - Conference contribution
AN - SCOPUS:8344269338
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 2263
EP - 2274
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -