Changes between Version 14 and Version 15 of GEC10Stitching

Timestamp:

04/04/11 14:50:29 (14 years ago)

Author:

Aaron Helsinger

Comment:

--

GEC10Stitching

@@ -65 +65 @@
 === Next steps ===
  - Schema: Jon Duerig of ProtoGENI is iterating on a PG-compatible stitching schema that preserves ION compatibility.
- - Functions: The community will continue discussion points as described below, particularly working out how chain & tree interoperate, and working though some use cases.
+ - Functions: The community will continue discussing key points, particularly working out how chain & tree interoperate, and working though some use cases.
  - API to be proposed for adoption at GEC11
  - Interoperability demonstration at GEC12
 
-=== Selected points from the discussions ===
- - Don't make use of all functions mandatory
+=== Selected points from the discussion ===
+ - Don't make use of all functions mandatory.
  - Functions are not necessarily new architectural boxes
- - Tom suggested some functions could have an implementation which exists as a central GENI service (eg Topology Service), available to all for use as desired.  Although use would not required.
+ - Tom suggested some functions could have an implementation which exists as a central GENI service (eg Topology Service), available to all for use as desired.  Although use would not be required.
  - The architecture should not force CFs to redo work they've already done
  - We must support both chain and tree workflows
-  - can they work together? Is 1 a subset of the other, modulo security?
- - How much direct negotiation between aggregates is required: this adds complexity, but without VLAN translation may be necessary
+  - Can they work together? Is 1 a subset of the other, modulo security?
+ - How much direct negotiation between aggregates is required? This adds complexity, but without VLAN translation may be necessary.
  - How prevalent should we expect translation to be? do we optimize for it?
  - Work out some use cases. For example, make sure a large topology that loops back (A -> B -> A) is explicitly worked through as an example and supported.