Message network monitoring
September 30, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesTraffic data collecting arrangement comprising a template data memory in each exchange Fabric-reinforced cementitious sheet-like structures and their production Call data collection and modification of received call distribution Distributed local-area-network monitoring system X.25 Wide area network channel status display Self routing packet switching network architecture Traffic pattern information for a local area network Packet route scheduling in a packet cross connect switch system for periodic and statistical packets Apparatus and method for realtime monitoring of network sessions in a local area network Maintaining historical LAN traffic statistics Patent #: 5231593 InventorAssigneeApplicationNo. 129513 filed on 09/30/1993US Classes:370/252, Determination of communication parameters370/393, Address concatenation379/133, Call traffic recording or monitoring379/134At central stationExaminersPrimary: Chin, WellingtonAttorney, Agent or FirmForeign Patent References
International ClassesH04M 015/08H04M 015/10 H04M 015/04 Foreign Application Priority Data1992-10-01 GBAbstractA 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. | |
