Talk:Dev:onl reservation algorithm

From ARL Wiki
Revision as of 14:42, 25 September 2008 by Jon Turner (talk | contribs) (New page: Suggested refinement of terminology. Let's refer to the physical infrastructure as a "host graph" and each reservation as a "guest graph". The problem we are solving is the scheduling of g...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Suggested refinement of terminology. Let's refer to the physical infrastructure as a "host graph" and each reservation as a "guest graph". The problem we are solving is the scheduling of guest graphs.

Need to add edge weights to both the physical topology and the reservations. Constrain the mapping of guest graphs onto the host graph so that the host graph edges are not overloaded.

Also, I think we want to include the notion of a multipoint link. That is, ports on several different components (not just 2) can be connected to a single multipoint link. This is implemented using a VLAN of course, preferably with all endpoints on the same infrastructure switch, but this need not be a hard constraint.

It's also important to include numbered ports on components in the guest graph. We're not just connecting components together. We are connecting specific ports of components and these port numbers are visible to users.

Jon