Bipartite graphical connection scheduling in time and space...

H - Electricity – 04 – L

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H04L 12/24 (2006.01) H04L 12/56 (2006.01)

Patent

CA 2332629

A method of adding a new connection (c, d) to a time:space:time switch fabric. The fabric has a set I of k input ele- ments, a set M of m switch elements, and a set O of l output elements. Each input element contributes one input to each switch element, and each output element receives one output from each switch element. A state S m characterizes the switch elements as a set of ordered pairs (i,j), where (i,j)~ S m if and only if the j th output element is coupled to the i th input element through one of the switch elements. The range of S m is the set of outputs of S m such that if j ~ range(S m) then (i,j) ~ S m for some i ~ I. The domain of S m is the set of inputs of S m such that if i ~ domain(S m) then (i,j) ~ S m for some j ~ O. If a switch state S m exists where c ~ domain(S m) and d ~ range(S m), then the new connection is added to S m as (c,d). If no such state exists, and if no switch state S m exists wherein c ~ domain(S m), then the method terminates because c is fully allocated. If there is a switch state S m wherein c ~ domain(S m), and if no switch state S n exists wherein d ~ range(S n), then the method terminates because d is fully allocated. If such a state S n exists, the two states S m, S n are joined to form a union J with each element (i',j') in J labelled u if (i',j') ~ S m, and each element (i',j') in J labelled v if (i', j') ~ S n. The new connection is then added to J as (c, d). A label (u or v) is allocated to the new connection. If new connection's label has not previously been allocated to a connection (i', d) ~ J the method termi- nates. Otherwise, the opposite label (v or u) is reallocated to connection (i', d) ~ J. If such opposite label has not previously been allocated to a connection (i',j') ~ J the method terminates. Otherwise, the originally selected label (u or v) is reallocated to connection (i',j') ~ J and the process repeats until no label conflicts remain. The originally selected label (u or v) is chosen to minimize the number of connections requiring reallocation of labels.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Bipartite graphical connection scheduling in time and space... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bipartite graphical connection scheduling in time and space..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite graphical connection scheduling in time and space... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1807925

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.