Download:
|
by Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta
ACM Computer Communications Review
http://www.cs.bu.edu/techreports/ps/2004-021-compositional-net-specs.ps
Add To MetaCart
Abstract:
The Science of Network Service Composition has clearly emerged as one of the grand themes driving many of our research questions in the networking field today [SMo]. This driving force stems from the rise of sophisticated applications and new networking paradigms. By "service composition " we mean that the performance and correctness properties local to the various constituent components of a service can be readily composed into global (end-to-end) properties without re-analyzing any of the constituent components in isolation, or as part of the whole composite service. The set of laws that would govern such composition is what will constitute that new science of composition. The combined heterogeneity and dynamic open nature of network systems makes composition quite challenging, and thus programming network services has been largely inaccessible to the average user. We identify (and outline) a research agenda in which we aim to develop a specification language that is expressive enough to describe different components of a network service, and that will include type hierarchies inspired by type systems in general programming languages that enable the safe composition of software components. We envision this new science of composition to be built upon several theories (e.g. control theory, game theory, network calculus, percolation theory, economics, queuing theory). In essence, different theories may provide different languages by which certain properties of system components can be expressed and composed into larger systems. We then seek to lift these lower-level specifications to a higher level by abstracting away details that are irrelevant for safe composition at the higher level, thus making theories scalable and useful to the average user. In this paper we focus on services built upon an overlay management architecture, and we use control theory and QoS theory as example theories from which we lift up compositional specifications.
Citations
|
2238
|
Chord: A scalable peerto-peer lookup service for internet applications
– Stoica, Morris, et al.
- 2001
|
|
905
|
Self-similarity in world wide web traffic:evidence and possible causes
– Crovella, Bestavros
- 1997
|
|
206
|
Internet Indirection Infrastructure
– Stoica, Adkins, et al.
- 2002
|
|
124
|
Forward and backward simulations part I: Untimed systems
– Lynch, Vaandrager
- 1995
|
|
120
|
Open issues and challenges in providing quality of service guarantees in high-speed networks
– Kurose
- 1993
|
|
106
|
Crovella and Azer Bestavros. Self-similarity in world wide web traffic: evidence and possible causes
– Mark
- 1997
|
|
83
|
The war between mice and elephants
– Guo, Matta
- 2001
|
|
80
|
The Stable Paths Problem and Interdomain Routing
– Griffin, Shepherd, et al.
- 2002
|
|
80
|
Forward and backward simulations -- Part II: Timing-based systems
– Lynch, Vaandrager
- 1996
|
|
49
|
Hari Balakrishnan, Chord: A Scalable Peer-to-peer Lookup Service for
– Stoica, Morris, et al.
- 2001
|
|
24
|
A calculus for end-to-end statistical service guarantees,” submitted
– Burchard, Liebeherr, et al.
- 2006
|
|
19
|
Periodic resource model for compositional realtime guarantees
– Shin, Lee
- 2003
|
|
18
|
TCP Congestion Control and Heavy Tails
– Guo, Crovella, et al.
- 2000
|
|
18
|
Differentiated control of web traffic: A numerical analysis
– Guo, Matta
- 2002
|
|
14
|
A spectrum of TCP-friendly window-based congestion control algorithms
– Jin, Guo, et al.
- 2003
|
|
13
|
Scheduling flows with unknown sizes: Approximate analysis,” Perf
– Guo, Matta
- 2002
|
|
12
|
A Load Profiling Approach to Routing Guaranteed Bandwidth Flows
– Matta, Bestavros
- 1998
|
|
8
|
and Frits Vaandrager. Forward and backward simulations -- Part II: Timing-based systems
– Lynch
- 1995
|
|
7
|
Modern Control Engineering, 4th Ed
– Ogata
- 2002
|
|
7
|
itmBench: Generalized API for Internet Traffic Managers
– Diamant, Veytser, et al.
- 2003
|
|
7
|
Boudec and Patrick Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
– Le
- 2001
|
|
4
|
Safe composition of web communication protocols for extensible edge services
– Bradley, Bestavros, et al.
- 2002
|
|
3
|
Yuting Zhang, “Providing Soft Bandwidth Guarantees Using Elastic TCP-based Tunnels
– Guirguis, Bestavros, et al.
- 2004
|
|
2
|
Providing Soft Bandwidth Guarantees Using Elastic TCP-based Tunnels
– Guirguis, Bestavros, et al.
- 2004
|
|
1
|
Systematic verification of safety properties of arbitrary network protocol compositions using CHAIN
– Bradley, Bestavros, et al.
- 2003
|
|
1
|
On the self-similarity of ethernet traffic
– Leland, Taqqu, et al.
- 1994
|
|
1
|
Systematic Verification of Safety
– Bradley, Bestavros, et al.
- 2003
|
|
1
|
Michael Smirnov (organizers
– Stavrakakis, Matta
- 2003
|
