Abstract: A liquification system for an organic waste management system includes a hopper that is oriented vertically such that organic waste added to the hopper is biased by gravity toward a bottom end of the hopper; an agitator that is disposed within the hopper and is movable in a first rotational direction that moves organic waste downward and in a second rotational direction that moves organic waste upward; a motor configured to selectively move the agitator in the first and second rotational directions under control of the controller; and a side grinding and drainage system disposed toward the bottom end of the hopper and preferably on a tapered portion of the hopper for grinding and liquefying organic waste.

Abstract: A technique transfers data over a packet-switched network (PSN), comprising a plurality of intermediate nodes, in a manner that does not require that the intermediate nodes support a network layer infrastructure. A network controller coupled to the intermediate nodes acquires topology information associated with the PSN's topology. This information may include pseudo-wire definitions, ingress and egress interface information, ingress and egress labels, and so on. The network controller generates a transport database from the topology information and distributes the transport database to the intermediate nodes. An intermediate node acquires the transport database information and configures a packet-processing engine (PPE), contained within the intermediate node, to process packets acquired by the intermediate node.

Abstract: A method for preventing loops in a ring topology of a computer network is disclosed. The method includes receiving a packet at a node on a shared packet ring and inserting a header containing an ID identifying the node at which the packet was received on the ring as an originating node. The packet is forwarded onto the ring and the ID is checked when received on a node. The packet is dropped if the ID identifies the node as the originating node.

Abstract: The present invention discloses a method and apparatus for preventing a layer-2 forwarding loop from being created within a network element (NE). Specifically, the present invention is used to prevent a loop from being formed within a NE by multiple data stitches for the same data circuit. The loops are prevented from being formed within the NE by running spanning tree on all but one of the multiple data stitches for a data circuit. The spanning tree blocks each of the data stitches on which it is run and thus only one data stitch remains and no loop is formed.

Abstract: Restricting the assignment of VLANs so that a unique VLAN or set of VLANs must be assigned to each link for a particular network circuit (NC) or group of NCs. NCs are prevented from being assignd a particular VLAN if the addition of the VLAN assignment will create a mix-match topology, which may either create a loop or prevent a loop from being able to be properly blocked without inadvertently blocking a link of another NC. Restriction of VLAN assignment allow a single conventional spanning tree to be run to ensure that there are no layer 2 forwarding loops exist while at the same time not inadvertently blocking the path of another NC.