next up previous
Next: Recursively partitioning networks Up: im99 Previous: Background


Basic operations

The MCA proposed here supports a few basic operation classes. For this paper, the relevant ones are:

1.
Unicast connection. Probably the most common operation is the connection from source to sink for a particular time interval with particular characteristics. If the admission control accepts accepts a request for such a connection, the client is guaranteed that the connection will be set up in that time interval. Traditional, immediate, connections simply leave out the interval in which case it defaults to $[now, \infty \rangle$.

2.
Multi-source, multi-sink connections. A small number of more complicated types of connections exist, such as a connection that is time-shared by multiple sources and which may have multiple sinks each with its own and possibly overlapping time interval. These are described in [#!Bos:98b!#].

3.
Information gathering. A rather wide-ranging class of operations to discover the state of the network, the topology, routes, available capacity, etc.

4.
Reservation of arbitrary sets of resources. The reservation of arbitrary sets resources is described in section [*].

5.
Loading application-specific code. Allowing applications to load their own code into the MCA allows them to exploit application-specific knowledge on a very low level. We will discuss loadable code in section [*].

The first two of these operation classes allow for reservation in advance, so that guarantees about the availability of resources at some time in the future can be given. These operations are very common and can be expected to be sufficient for the majority of applications. We call these the primary operations. All other operations mentioned above are called secondary operations.


next up previous
Next: Recursively partitioning networks Up: im99 Previous: Background
Herbert Bos
2001-12-11