1461132014-fdce99b1-43e8-4a24-a5df-44df523f0378

1. A method comprising:
generating, independently of a spanning tree protocol instance, a first protocol message identifying a best root node of a spanning tree implemented by an access domain;
transmitting, by the first aggregation node, the first protocol message to a plurality of access nodes of the access domain;
receiving data traffic from the plurality of access nodes, each access node of the plurality of access nodes implementing a spanning tree protocol instance that selects the best root node as a root node of the spanning tree; and
aggregating the data traffic and other data traffic of a plurality of access domains and transmitting the aggregated data traffic to an aggregation network.
2. The method of claim 1, the spanning tree further comprising:
a second aggregation node configured to transmit a second protocol message identifying the second aggregation node as a second best root node of the spanning tree.
3. The method of claim 1, further comprising:
receiving, at the first aggregation node, a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
communicating the topology change to an element of the aggregation network.
4. The method of claim 1, further comprising:
receiving, at the first aggregation node, a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
communicating the topology change to a first subset of the plurality of access nodes.
5. The method of claim 1, further comprising:
receiving, at the first aggregation node, a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
forwarding the spanning tree protocol message over a pseudowire connection to allow a second aggregation node to communicate the topology change to a second subset of the plurality of access nodes.
6. The method of claim 1, further comprising:
sensing a failure of the best root node; and
transmitting a second protocol message from the first aggregation node, the second root message identifying the best root node as a third best root node of the spanning tree.
7. The method of claim 6, further comprising:
sensing a recovery of the best root node;
waiting for a predetermined period of time; and
transmitting the first protocol message from the first aggregation node.
8. The method of claim 1, the first protocol message identifying the first aggregation node or a virtual node of the aggregation network as the best root node.
9. The method of claim 1, further comprising:
receiving a subset of additional data traffic of a plurality of virtual local access networks, the additional data traffic of the plurality of virtual local access networks load balanced between the first aggregation node and a second aggregation node.
10. An apparatus comprising:
a memory configured to store computer executable instructions; and
one or more processors coupled to the memory, the processors configured, when executing the instructions, to:
generate, independently of a spanning tree protocol instance, a first protocol message identifying a best root node of a spanning tree implemented by an access domain;
transmit the first protocol message from a first aggregation node to a plurality of access nodes of the access domain;
receive data traffic from the plurality of access nodes, each access node of the plurality of access nodes implementing a spanning tree protocol instance that selects the best root node as a root node of the spanning tree; and
aggregate the data traffic and other data traffic of a plurality of access domains and transmit the aggregated data traffic to an aggregation network.
11. The apparatus of claim 10, the spanning tree further comprising:
a second aggregation node configured to transmit a second protocol message identifying the second aggregation node as a second best root node of the spanning tree.
12. The apparatus of claim 10, the processors further configured to:
receive a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
communicate the topology change to an element of the aggregation network.
13. The apparatus of claim 10, the processors further configured to:
receive a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
communicate the topology change to a first subset of the plurality of access nodes.
14. The apparatus of claim 10, the processors further configured to:
receive a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
forward the spanning tree protocol message over a pseudowire connection to allow a second aggregation node to communicate the topology change to a second subset of the plurality of access nodes.
15. The apparatus of claim 10, the processors further configured to:
sense a failure of the best root node; and
transmit a second protocol message from the first aggregation node, the second protocol message identifying the best root node as a third best root node of the spanning tree.
16. The apparatus of claim 10, the processors further configured to:
sense a recovery of the best root node;
wait for a predetermined period of time; and
transmit the first protocol message from the first aggregation node.
17. The apparatus of claim 10, the first protocol message identifying the first aggregation node or a virtual node of the aggregation network as the best root node.
18. The apparatus of claim 10, the processors further configured to:
receive a subset of additional data traffic of a plurality of virtual local access networks, the additional data traffic of the plurality of virtual local access networks load balanced between the first aggregation node and a second aggregation node.
19. A tangible computer-readable medium having computer-executable code, when executed by a computer operable to:
generate, independently of a spanning tree protocol instance, a first protocol message identifying a best root node of a spanning tree implemented by an access domain;
transmit the first protocol message from a first aggregation node to a plurality of access nodes of the access domain;
receive data traffic from the plurality of access nodes, each access node of the plurality of access nodes implementing a spanning tree protocol instance that selects the best root node as a root node of the spanning tree; and
aggregate the data traffic and other data traffic of a plurality of access domains and transmit the aggregated data traffic to an aggregation network.
20. The medium of claim 20, the spanning tree further comprising:
a second aggregation node configured to transmit a second protocol message identifying the second aggregation node as a second best root node of the spanning tree.
21. The medium of claim 20, the medium further operable to:
sense a failure of the best root node; and
transmit a second protocol message from the first aggregation node, the second protocol message identifying the best root node as a third best root node of the spanning tree.
22. The medium of claim 20, the medium further operable to:
sense a recovery of the best root node;
wait for a predetermined period of time; and
transmit the first protocol message from the first aggregation node.
23. The medium of claim 20, the medium further operable to:
receive a spanning tree protocol message from an access node, the spanning tree protocol message identifying a topology change of the access domain; and
communicate the topology change to one or more of the following:
an element of the aggregation network;
a second aggregation node; and
an access node of the plurality of access nodes.
24. The medium of claim 20, the medium further operable to:
receive a subset of additional data traffic of a plurality of virtual local access networks, the additional data traffic of the plurality of virtual local access networks load balanced between the first aggregation node and a second aggregation node.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. An apparatus for cleaning a chalkboard, wherein the chalkboard is substantially upright standing, said chalkboard having first and second opposing ends, and top and bottom opposing edges, said apparatus comprising;
a) a rail disposed on said top edge of said chalkboard, said rail extending from said first end to said second end of said chalkboard, said rail having a channel therein, said rail having end caps on said first and second ends thereof; and,
b) a chalkboard cleaning member being removably disposed on said rail whereby the chalkboard cleaning member cleans the chalkboard while moving along the rail from the first end to the second end of the chalkboard, wherein said chalkboard cleaning member comprises;
i) a support bracket having upper and lower opposing ends, a front and rear edge, and a top and bottom side wherein said bottom side is oriented toward said chalkboard;
ii) a wheel being disposed on said upper end of said support bracket, wherein said wheel is inserted into said channel of said rail to permit the support bracket to move along the rail from the first end to the second end of the chalkboard;
iii) a reservoir containing fluid being removably disposed on said top side of said support bracket, said reservoir having upper and lower ends;
iv) a sponge being fixed on said bottom side of said support bracket to permit the sponge to make contact with the chalkboard so that the sponge can clean the chalkboard, said sponge extending from said upper to the lower end of said support bracket;
v) a plurality of spray nozzles being disposed on said bottom side of said support bracket in a spaced apart manner, wherein fluid from said spray nozzles are directed toward said sponge to permit the chalkboard to be cleaned;
vi) a pump being disposed on said reservoir for pumping fluid from said reservoir to said spray nozzles to permit fluid from the reservoir to be sprayed into the sponge; and
vii) a handle being disposed on said reservoir to permit a user to grasp the handle and thereby move the support bracket.
2. The apparatus of claim 1, wherein said support bracket is adjustable in length to permit it to fit various sizes of chalkboards.
3. The apparatus of claim 2, wherein said support bracket comprises an outer sleeve portion having an aperture therein and an inner sleeve portion having a plurality of spaced apart apertures therein, wherein said inner sleeve telescopes within said outer sleeve to permit the length of the support bracket to be varied, further comprising a pin which is inserted through said aperture of said outer sleeve into one of the co-aligned said plurality of apertures of said inner sleeve so as to secure said inner sleeve to said outer sleeve to permit the support bracket to be secured in a selected position.
4. The apparatus of claim 3, wherein said wheel rotates on a shaft, said shaft being disposed on said bottom side of said upper end of said support bracket, wherein said shaft is mounted perpendicular to said support bracket to permit the support bracket to move along the rail from the first end to the second end of the chalkboard.
5. The apparatus of claim 4, wherein said shaft of said wheel is extendably retractable along its longitudinal length to permit the support bracket to be moved away from the chalkboard so that the support bracket can be repositioned.
6. The apparatus of claim 5, wherein said shaft of said wheel is spring loaded to permit the shaft to be extendably retractable along its longitudinal length.
7. The apparatus of claim 6, wherein said pump is manually operated, further comprising a pump actuator button being disposed on said reservoir to permit a user to operate the pump.
8. The apparatus of claim 7, further comprising a fill cap being disposed on said reservoir to permit fluid to be placed in the reservoir.
9. The apparatus of claim 8, wherein said fill cap is disposed on said upper end of said reservoir further comprising a reservoir bracket for attaching said upper end of said reservoir to said support bracket.
10. The apparatus of claim 9, further comprising a semi-circular clip disposed on said top side of said support bracket, wherein said clip partially surrounds said lower end of said reservoir to permit the reservoir to be secured onto the support bracket.
11. The apparatus of claim 10, wherein said sponge is about 55 inches in length to permit use with a standard chalkboard.
12. The apparatus of claim 11, further comprising an additional rail being disposed on said chalkboard, wherein said additional rail is disposed on said bottom edge of said chalkboard.
13. The apparatus of claim 12, further comprising an additional wheel being disposed on said bottom end of said support bracket for insertion into said additional rail to permit the support bracket to move along the rail from the first end to the second end of the chalkboard.