Abstract:
A communication network consists of end units (EUs) and distribution units (DUs) coupled together by links which may include local area networks (LANs). The units maintain neighbor tables by sending out Hello messages which indicate the unit type and contain the network service access point (NSAP) IDs or addresses of the units. Data messages (packets) mainly originate and end at EUs. An EU maintains only partial routing information about neighbors, while the DUs collectively maintain complete information about all NSAPs. So if an EU wants to send a packet to an EU which is not a neighbour (and sometimes even if it is), it need merely send it to a neighboring DU; that DU, along with the other DUs, must find a route to the destination EU. This invention provides a hybrid unit (HU), which acts as a DU to EUs but as an EU to DUs. The HU provides DU-like message forwarding but only on a local basis within a subnetwork of EUs and HUs.
Abstract:
A digital message routing network has at least some nodes at which messages are monitored for accounting purposes. Such a node contains means for generating and compressing accounting digests, each of which consists of a key K representing the nature and route of the message and a value V associated with the message. For each message, a digest is produced in register 30, and copied into a location in a first memory 22D at a location determined by hashing its key; further digests with the same key are compressed into the digest already in that location. A second memory 23D is operated as a cyclic buffer with head and tail counters HDCT 40 and TLCT 41. The address of the head of the buffer, ie the valid area of memory 23D, is included as an index I in each digest in the first memory 22D as that digest is created. Each time a digest is created or changed in the first memory 22D, it is copied into the second memory at the location in the second memory determined by its index. Digests are read out from the second memory in blocks; the corresponding digests in the first memory thereby become invalid, and have to be restarted by initializing their values and giving them new indexes.
Abstract:
Means are disclosed for securing together a first, U-shaped member and a second member received within the first member. In the preferred embodiment, the second member is a holder for a mineral cutter pick and the U-shaped member is formed on a drum or cutter chain of a mining machine. The means comprise registering bores in the legs of the U-shaped member and in the second member, one of the members being formed with a recess extending transversely from the bore therein. A hollow cross pin is received within the bores and a locking pin is driven through a transverse bore in the cross pin to extend into said recess. The cross pin has a length equal to or less than said bores in registration, and part of its internal surface is provided with a screw thread.
Abstract:
A message switching network is disclosed which consists of end units between which messages flow. The end units are coupled together directly (via LANs) or via common switching nodes through level 0 links; the nodes are coupled together via level 1 links; and the nodes are grouped into areas which are coupled together via level 2 links. A message entering a node has its destination area code compared with the node's area code, and an area/port table or an end unit/port table is used to look up the output port which is coupled to the end unit, next node in the area, or next area to which that message is to be delivered. Logic circuitry determines the incoming and outgoing levels, and a transition between levels is logged together with certain details of the message. Messages are thus monitored--i.e., their passage is recorded--when they cross levels in the hierarchy. Thus, provided the network is "well-behaved", messages are accurately counted and categorized according to the distances which they travel through the network.
Abstract:
A system, method and computer program product are provided for controlling the rate of a network flow. In use, a rate of a network flow is monitored. In addition, it is determined whether the rate exceeds a threshold. Further, at least a portion of the network flow is conditionally discarded or marked, based on the determination.