Abstract: The present invention provide an open network game system and method, including: a server end having a database for storing the required data for editing game interfaces; and a user end having a data acquiring module, an interface editing module, and an event editing module, wherein the data acquiring module acquires the required data from said server end for editing game interfaces, allowing said interface editing module to edit and generate an interface documentation accordingly. Moreover, when said user end edits a game event, the data acquiring module acquires the required data from said server end for editing a game interface and transmit the edited documentation to said server end for verification of the edited documentation, and further converts the valid documentation to a network game event recognizable by network games, and lastly publish the game event to allow other user ends to acquire and execute the game event.

Abstract: A heterogeneous-network switch comprises a number of different-type media access controllers (MAC's) each respectively for connection to otherwise incompatible computer networks. An incoming data bus is connected to collect datapackets from each of the different-type MAC's. An outgoing data bus is connected to distribute datapackets to each of the different-type MAC's. And, a traffic shaping cell (TSCELL) having an input connected to the incoming data bus and an output connected to the outgoing data bus, provides for traffic control of said datapackets according to a bandwidth capacity limit of a corresponding one of said otherwise incompatible computer networks to receive them. The switch is based on a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection.

Abstract: A semiconductor integrated circuit chip comprises a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Each of the service-level agreement policies maintains a statistic that tracks how many datapackets are being buffered at any one instant. A test is made of each policy's statistic for each newly arriving datapacket. If the policy associated with the datapacket's destination indicates the agreed bandwidth limit has been reached, the datapacket is buffered and forwarded later when the bandwidth would not be exceeded.

Abstract: A network-node bandwidth-allocation credit method includes computing credits after each completed scan of a packet-tracking queue. Such queue varies tremendously in depth, according to how much network traffic is transitioning through the involved network nodes. A bandwidth traffic-shaping manager operates to control the maximum bandwidth permitted to pass through each network node, e.g., by buffering datapackets that would exceed some service policy limit if forwarded immediately on receipt. As each network node runs less that its policy maximum, it is given a number of credits that collect in a bank account. If a datapacket presents itself that involves passage through the network node, such bank account is checked to see if sufficient bandwidth-allocation credits exist to forward the datapacket immediately. If so, an appropriate deduction of credits is made and the datapacket is forwarded toward its destination.

Abstract: A multicast method generates a packet-tracking queue with individual entries representing datapackets for transfer through a hierarchical network. The actual datapacket and its real payload are stored as one item in a FIFO buffer. Any packet-tracking queue entry representing a multicast datapacket is expanded into several consecutive entries, one each for the individual subscribers enrolled to receive a broadcast. A first of such expanded entries is flagged as being first, and a last such expanded entry is flagged as being last. Each expanded entry may be subject to its own unique service-level policy, with the result that the datapackets can be released and cleared in any order. If the first or last are released, then the next are marked as first or last. When only one expanded entry is left, it will be flagged as being both first and last. When it is released, the entry in the packet-tracking queue is cleared as well as the actual datapacket and its real payload in the FIFO buffer.

Abstract: A method and a semiconductor intellectual property embodiment of the present invention comprise a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. All limit checking is done in one clock cycle for the entire network hierarchy above a particular node, and previously independent and separate queues are combined into one super queue.

Abstract: A method comprises using a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Each of the service-level agreement policies maintains a statistic that tracks how many datapackets are being buffered at any one instant. A test is made of each policy's statistic for each newly arriving datapacket. If the policy associated with the datapacket's destination is currently buffering, or holding, any datapackets, then the newly arriving datapacket is sent to be buffered too. This allows the longest waiting datapacket for the particular destination to be released and cleared from the buffer first.

Abstract: A network comprises a local group of network workstations and clients that periodically need access to a wide area network like the Internet. A class-based queue traffic shaper is placed in between and enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Which policy is appropriate to enforce is found by placing all IP-addresses with policies attached to them into an ordered list of three-byte segment numbers. The least significant byte of an IP-address is dropped to form a segment number. Classification then depends on finding the IP-address in a datapacket to the ordered list of segment numbers. If a match occurs, an index lookup table for the respective segment allows the least-significant fourth byte of the IP-address to point to the bandwidth policy to use.

Abstract: A network comprises a local group of network workstations and clients that periodically need access to a wide area network like the Internet. A class-based queue traffic shaper is placed in between and enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination application types. Which policy is appropriate to enforce is found by listing all standard port numbers for an application in a single port group. Policies are attached according to port group. The field of over 64K possible port numbers is thus reduced to a short list of application groups, e.g., twelve or less. When a datapacket arrives that needs to be classified according to application, its port numbers are used to index a port group table This returns an application type and a concomitant service-level agreement policy.

Abstract: A system for monitoring the charge flow in a hydrostatic system. The system provides a sharp edge orifice restriction in the drain from the hydrostatic pump, creating a back pressure in the drain that is proportional to the fluid flow through the drain. A pressure switch mounted in the pump case, or in the drain, detects the back pressure in the drain. The pressure switch is designed to be activated at a back pressure that corresponds to the intended charge flow at a specific engine speed. During operation, if the back pressure is not sufficient to cause the pressure switch to be activated at the predetermined engine speed or at a faster engine speed, the charge flow is not sufficient and a warning signal is generated.

Abstract: A hydraulic system having a standpipe in a sump with ports on the side of the standpipe and one smaller port on the top of the standpipe. The majority of the oil flows into the standpipe through the side ports thereby reducing the downward suction and flow at the top of the standpipe to eliminate the formation of a vortex at the top of the standpipe. As a result, less air is drawn into the oil producing a more consistent oil/air mixture and more consistent sump oil level.

Abstract: A supplemental charge for a hydrostatic steering system is provide by coupling the output of the transmission oil pump to the outlet of the steering charge pump and providing a check valve to prevent oil flow from the transmission oil pump to the steering charge pump unless the charge pump outlet pressure drops below the operating pressure of the transmission pump. When the steering charge pressure does drop below the transmission oil pressure, the check valve opens and oil is provided to the main steering pump by the transmission oil pump. A pressure transducer in the oil line activates a warning signal in the event the check valve is open more than a few minutes to alert the vehicle operator to a system failure.