US4792921A - Network event identifiers - Google Patents

Network event identifiers Download PDF

Info

Publication number
US4792921A
US4792921A US06/841,070 US84107086A US4792921A US 4792921 A US4792921 A US 4792921A US 84107086 A US84107086 A US 84107086A US 4792921 A US4792921 A US 4792921A
Authority
US
United States
Prior art keywords
event
time
signal
identifier
generating
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US06/841,070
Inventor
Daniel W. Corwin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Amiga Development LLC
Original Assignee
Wang Laboratories Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=25283943&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=US4792921(A) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Wang Laboratories Inc filed Critical Wang Laboratories Inc
Priority to US06/841,070 priority Critical patent/US4792921A/en
Assigned to WANG LABORATORIES, INC., A CORP OF MASSACHUSETTS reassignment WANG LABORATORIES, INC., A CORP OF MASSACHUSETTS ASSIGNMENT OF ASSIGNORS INTEREST. Assignors: CORWIN, DANIEL W.
Priority to JP61296497A priority patent/JPH0797347B2/en
Priority to CA000532232A priority patent/CA1257419A/en
Priority to AU70090/87A priority patent/AU591551B2/en
Priority to EP87103838A priority patent/EP0238039B2/en
Priority to DE3782349T priority patent/DE3782349T3/en
Application granted granted Critical
Publication of US4792921A publication Critical patent/US4792921A/en
Assigned to FIRST NATIONAL BANK OF BOSTON reassignment FIRST NATIONAL BANK OF BOSTON SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WANG LABORATORIES, INC.
Assigned to CONGRESS FINANCIAL CORPORATION (NEW ENGLAND) reassignment CONGRESS FINANCIAL CORPORATION (NEW ENGLAND) SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WANG LABORATORIES, INC.
Assigned to WANG LABORATORIES, INC. reassignment WANG LABORATORIES, INC. TERMINATION OF SECURITY INTEREST Assignors: FIRST NATIONAL BANK OF BOSTON, AS TRUSTEE
Assigned to WANG LABORATORIES, INC. reassignment WANG LABORATORIES, INC. RELEASE OF SECURITY INTEREST IN AND REASSIGNMENT OF U.S. PATENTS AND PATENT APPLICATIONS Assignors: CONGRESS FINANCIAL CORPORATION (NEW ENGLAND)
Assigned to BT COMMERCIAL CORPORATION (AS AGENT) reassignment BT COMMERCIAL CORPORATION (AS AGENT) SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WANG LABORATORIES, INC.
Assigned to BT COMMERICAL CORPORATION reassignment BT COMMERICAL CORPORATION SECURITY AGREEMENT Assignors: WANG LABORATORIES, INC.
Assigned to AMIGA DEVELOPMENT, LLC reassignment AMIGA DEVELOPMENT, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WANG LABORATORIES, INC.
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/22—Arrangements for supervision, monitoring or testing
    • H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/1734—Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/54—Arrangements for diverting calls for one subscriber to another predetermined subscriber
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/42—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker
    • H04Q3/54—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised
    • H04Q3/545—Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised using a stored programme
    • H04Q3/54575—Software application
    • H04Q3/54583—Software development, e.g. procedural, object oriented, software generation, software testing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13056—Routines, finite state machines

Definitions

  • This invention relates to the operation of data processing nodes connected in a network to comprise a data processing system, and particularly to the generation of identifiers for events such as file creation, for use in the network.
  • a file is created at a stand-alone data processing device
  • an identifier is automatically assigned by the device, while in others the user may assign any identifier he chooses to the file (within the device file-naming conventions), so long as the identifier is unique among the identifiers in use at the device.
  • such means can search only identifiers in current use, not those of files which have been deleted or archived. It is therefore possible for a file identifier to be used to identify more than one file over a period of time.
  • Nodes in a network may be independently designed devices, each of which has its own local file naming convention. It is difficult to change these conventions after the devices are in use. When such devices are connected in a network, the different conventions introduce difficulties of communication between devices.
  • a plurality of file-naming rules make cross-node file references by file name awkward or even impossible in the general case. Because of this difficulty, if it is necessary to share the data content of a file across nodes, the file may have to be copied in its entirety, renamed, and stored locally. This is inefficient. Further, if one copy is changed locally, inconsistencies arise between the versions.
  • Global file naming conventions can solve many of these problems.
  • One method that is used to provide unique file identifiers is to refer to a central catalog or master memory in the system; however, in distributed networks there is no defined "central" location for this name-management facility. Even if one node is arbitrarily chosen for this purpose, it may not be accessible to all other nodes at all times during their operation.
  • the central node when the "central" node is temporarily down, the other nodes on the network will be unable to refer to it in order to assign unique file identifiers. Alternatively, if a node is temporarily disconnected from the network, it cannot refer to the central node in order to verify a file identifier.
  • a method of generating a unique event identifier signal for a qualifying event comprising the steps: providing and storing call number signals representing the call number of a telephone terminal associated with the node; providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller then x; providing an event signal responsive to occurrence of a qualifying event; generating, responsive to the event signal, to the stored call number signals and to the time signals indicative of a denominated time most closely associated with the time of provision of the event signal, an identifier signal associated with the event; and storing the identifier signal.
  • the event signal is also responsive to a characteristic of the event, and the identifier signal is indicative of the the event characteristic.
  • the identifier signal is indicative of the event characteristic.
  • a plurality of such nodes are connected together in a network.
  • identifier means for generating a unique identifier signal for any qualifying event.
  • the identifier means comprises storage means; call number means for providing and storing in the storage means signals representing the call number of a telephone terminal associated with the node; time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x; event signal means responsive to occurrence of a qualifying event for providing an event signal; and generating means responsive to an event signal, to the stored call number signals and to the time signals indicative of a denominated time most closely associated with the time of provision of the event signal, for generating an identifier signal associated with the event, and for storing the identifier signal in the storage means.
  • the event signal means is also responsive to a characteristic of the event for providing the event signal, and the generated identifier signal is indicative of the event characteristic.
  • analysis means comprising first decomposing means responsive to a generated event identifier signal for generating time signals indicative of the denominated time most closely associated with the time of occurrence of the event identified by the identifier signal; second decomposing means responsive to a generated event identifier signal for generating call number signals representing the call number of the telephone terminal associated, at the time of occurrence of the identified event, with the node at which the event identifier signal was generated; and third decomposing means responsive to a generated event identifier signal for generating event characteristic signals indicative of the characteristic of the identified event.
  • FIG. 1 is a schematic showing of a node in which the present invention is practiced.
  • a data processing device 10 comprises a central processing unit 12, an internal clock 14, and storage 16. Input/output means conventionally comprising a display 18 and keyboard 20 is provided.
  • a telephone terminal 24 is associated with device 10. Terminal 24 may be a handset or other type of terminal having a unique call number. Terminal 24 need not be physically connected with device 10; its call number is stored in buffer 26 either by being entered through keyboard 20 or in any other convenient way.
  • a real-time clock 28 is associated with a device 10; the time shown by this clock is used to provide a fiduciary time for the internal clock 14. This fiduciary time may be entered through keyboard 20 or in any other convenient way.
  • central processor 12 operates according to an operating system program 30, stored in storage 16, to manage the data processing and other activities of the device.
  • an event routine 32 is provided in operating system program 30.
  • Designers of higher level programming for the device select certain events as qualifying events, that is, events for which it is desired to provide an identifier. Such events may be, for example, file creation, keyboard input, or logging on or off. Provision is made for calling event routine 32 upon occurrence of such a qualifying event.
  • Device 10, under the control of event routine 32 generates an event signal, which desirably represents a characteristic of the event, that is, its type or class. Qualifying events are assumed to occur of device 10 at time intervals having a minimum size of x seconds.
  • Clock 14 provides time signals indicative of distinctly denominated times; any two successive denominated times are separated by a time interval smaller than x. Typically, successive denominated times are separated by 1/20 second, of the order of conventional disk access time.
  • An identifier routine 34 is provided in operating system 30. This routine responds to the event signal by referring to the call number buffer 26 and to clock 14, and generates responsive to the event signal, to the stored call number signals and to the time signals from clock 14, an identifier signal associated with the event. This identifier signal is stored, for example at 45 in file index 40 (in storage 16) or wherever a file identifier is conventionally used.
  • the identifier is desirably in the form of a Node field 42, comprising signals representing the call number from buffer 26, a Time field 44, comprising time signals from clock 14 indicative of a denominated time most closely associated with the time of the event signal, and a Type field 46, comprising signals indicative of the type of event (event characteristic). These signals may be packed or concatenated in ay convenient way.
  • An identifier generated according to the present invention can be used by any node in the system, which can therefore access the identified file without further information if the nodes are connected through the global telephone network.
  • Events or objects other than file creation that may desirably be identified according to my invention are creation or change of any network node, a hardware component in the node, the person or organization typically using the node, or transient data structures.
  • an identifier generated according to my invention can be analyzed to derive information that is useful in accessing the identified file or otherwise.
  • three decomposition routines are provided in operating system 30.
  • Decomposition routine 50 generates, in response to a provided identifier generated as described above, the call number of the telephone terminal that was associated, at the time of the event, with the node where the event occurred. This information is useful, if the identified file has been archived but is not longer stored in the node; a telephone call to the derived call number is likely to reach an operator who can provide the identified file.
  • call forwarding information can be provided at the node if the associated telephone terminal has been changed.
  • Decomposition routine 52 generates, in response to a provided identifier generated as described above, the denominated time closest to the time when the event occurred. This information is frequently desired by users of data processing devices.
  • decomposition routine 54 generates, in response to a provided identifier generated as described above, signals representing the characteristic or type of the event. This information is useful in the internal operation of the device; for example, a program branch can be conditioned on the event characteristic.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Telephonic Communication Services (AREA)
  • Small-Scale Networks (AREA)
  • Exchange Systems With Centralized Control (AREA)

Abstract

Identifiers for events occurring at a network node are generated responsive to the time of the event, to a telephone number associated with the node, and to an event characteristic. In a network all of whose nodes use this method, an identifier can be generated at one node without reference to any other node, which will be unique over the network. An identifier generated by this method can be decomposed to recover the time of the event, the telephone number associated with the node at which the event occurred at the time of occurrence, or the event characteristic.

Description

FIELD OF THE INVENTION
This invention relates to the operation of data processing nodes connected in a network to comprise a data processing system, and particularly to the generation of identifiers for events such as file creation, for use in the network.
DESCRIPTION OF THE RELATED ART
When a file is created at a stand-alone data processing device, in some such devices an identifier is automatically assigned by the device, while in others the user may assign any identifier he chooses to the file (within the device file-naming conventions), so long as the identifier is unique among the identifiers in use at the device. It is usual to provide at the device means for comparing a newly assigned identifier with those already in use, and to reject an identifier that is found to be identical which one in use. Generally, such means can search only identifiers in current use, not those of files which have been deleted or archived. It is therefore possible for a file identifier to be used to identify more than one file over a period of time.
When the device is a node in a data processing network, problems in identifying files may arise from several sources. Nodes in a network may be independently designed devices, each of which has its own local file naming convention. It is difficult to change these conventions after the devices are in use. When such devices are connected in a network, the different conventions introduce difficulties of communication between devices. A plurality of file-naming rules make cross-node file references by file name awkward or even impossible in the general case. Because of this difficulty, if it is necessary to share the data content of a file across nodes, the file may have to be copied in its entirety, renamed, and stored locally. This is inefficient. Further, if one copy is changed locally, inconsistencies arise between the versions.
Global file naming conventions can solve many of these problems. One method that is used to provide unique file identifiers is to refer to a central catalog or master memory in the system; however, in distributed networks there is no defined "central" location for this name-management facility. Even if one node is arbitrarily chosen for this purpose, it may not be accessible to all other nodes at all times during their operation.
For example, when the "central" node is temporarily down, the other nodes on the network will be unable to refer to it in order to assign unique file identifiers. Alternatively, if a node is temporarily disconnected from the network, it cannot refer to the central node in order to verify a file identifier.
SUMMARY OF THE INVENTION
It is therefore desirable to provide a method and means for providing event (such as file creation) identifiers that ensure that each identifier is unique over a network of nodes. It is further desirable that such a method and means be operable entirely within a single node, whether or not the node is connected into the network at the time of the event.
It is an object of the present invention to provide such method and means for generating unique event identifiers that do not require reference or physical link to any shared central naming facility or catalog.
It is a further object of the present invention to provide method and means for generating unique event identifiers providing information about the time and place of the identified event, as well as information about the nature of the event.
According to a first aspect of the invention, there is provided, in the operation of a data processing node at which successive qualifying events can occur at time intervals no smaller than x, a method of generating a unique event identifier signal for a qualifying event, comprising the steps: providing and storing call number signals representing the call number of a telephone terminal associated with the node; providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller then x; providing an event signal responsive to occurrence of a qualifying event; generating, responsive to the event signal, to the stored call number signals and to the time signals indicative of a denominated time most closely associated with the time of provision of the event signal, an identifier signal associated with the event; and storing the identifier signal.
In preferred embodiments, the event signal is also responsive to a characteristic of the event, and the identifier signal is indicative of the the event characteristic. Desirably, a plurality of such nodes are connected together in a network.
According to another aspect of my invention, there is provided in a data processing node, at which successive qualifying events can occur at any node at time intervals no smaller than x, identifier means for generating a unique identifier signal for any qualifying event. The identifier means comprises storage means; call number means for providing and storing in the storage means signals representing the call number of a telephone terminal associated with the node; time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x; event signal means responsive to occurrence of a qualifying event for providing an event signal; and generating means responsive to an event signal, to the stored call number signals and to the time signals indicative of a denominated time most closely associated with the time of provision of the event signal, for generating an identifier signal associated with the event, and for storing the identifier signal in the storage means.
In preferred embodiments, the event signal means is also responsive to a characteristic of the event for providing the event signal, and the generated identifier signal is indicative of the event characteristic. There is also provided analysis means comprising first decomposing means responsive to a generated event identifier signal for generating time signals indicative of the denominated time most closely associated with the time of occurrence of the event identified by the identifier signal; second decomposing means responsive to a generated event identifier signal for generating call number signals representing the call number of the telephone terminal associated, at the time of occurrence of the identified event, with the node at which the event identifier signal was generated; and third decomposing means responsive to a generated event identifier signal for generating event characteristic signals indicative of the characteristic of the identified event.
These and other objects, features and advantages of the present invention will appear from the following description of a preferred embodiment, together with the drawing, in which
BRIEF DESCRIPTION OF THE DRAWING
FIG. 1 is a schematic showing of a node in which the present invention is practiced.
DESCRIPTION OF THE PREFERRED EMBODIMENT
Referring now to the drawing, a data processing device 10 comprises a central processing unit 12, an internal clock 14, and storage 16. Input/output means conventionally comprising a display 18 and keyboard 20 is provided. A network interface 22, which may be a modem or other appropriate means, connects the device into a network. A telephone terminal 24 is associated with device 10. Terminal 24 may be a handset or other type of terminal having a unique call number. Terminal 24 need not be physically connected with device 10; its call number is stored in buffer 26 either by being entered through keyboard 20 or in any other convenient way. A real-time clock 28 is associated with a device 10; the time shown by this clock is used to provide a fiduciary time for the internal clock 14. This fiduciary time may be entered through keyboard 20 or in any other convenient way.
As is well understood in the art, central processor 12 operates according to an operating system program 30, stored in storage 16, to manage the data processing and other activities of the device.
According to the present invention, an event routine 32 is provided in operating system program 30. Designers of higher level programming for the device select certain events as qualifying events, that is, events for which it is desired to provide an identifier. Such events may be, for example, file creation, keyboard input, or logging on or off. Provision is made for calling event routine 32 upon occurrence of such a qualifying event. Device 10, under the control of event routine 32, generates an event signal, which desirably represents a characteristic of the event, that is, its type or class. Qualifying events are assumed to occur of device 10 at time intervals having a minimum size of x seconds.
Clock 14 provides time signals indicative of distinctly denominated times; any two successive denominated times are separated by a time interval smaller than x. Typically, successive denominated times are separated by 1/20 second, of the order of conventional disk access time.
An identifier routine 34 is provided in operating system 30. This routine responds to the event signal by referring to the call number buffer 26 and to clock 14, and generates responsive to the event signal, to the stored call number signals and to the time signals from clock 14, an identifier signal associated with the event. This identifier signal is stored, for example at 45 in file index 40 (in storage 16) or wherever a file identifier is conventionally used.
The identifier is desirably in the form of a Node field 42, comprising signals representing the call number from buffer 26, a Time field 44, comprising time signals from clock 14 indicative of a denominated time most closely associated with the time of the event signal, and a Type field 46, comprising signals indicative of the type of event (event characteristic). These signals may be packed or concatenated in ay convenient way.
I estimate that an identifier format comprising 16 bytes is adequate to conveniently and unambiguously described at least 1000 events per second at each phone number in the world for at least the next 1000 years. File catalog systems on most current computer systems support file names of at least 16 bytes, so the identifier generated according to the present invention can be adopted within the framework of most existing file naming and cataloging methods. In a network of nodes in which my invention is employed, a file identifier generated according to my invention is unique among all identifiers generated in the network at any time, not merely among those catalogued or indexed at the time of generation. Thus even archived and deleted files remain uniquely identified.
An identifier generated according to the present invention can be used by any node in the system, which can therefore access the identified file without further information if the nodes are connected through the global telephone network.
Events or objects other than file creation that may desirably be identified according to my invention are creation or change of any network node, a hardware component in the node, the person or organization typically using the node, or transient data structures.
According to a futher aspect of my invention, an identifier generated according to my invention can be analyzed to derive information that is useful in accessing the identified file or otherwise. For this purpose, three decomposition routines are provided in operating system 30. Decomposition routine 50 generates, in response to a provided identifier generated as described above, the call number of the telephone terminal that was associated, at the time of the event, with the node where the event occurred. This information is useful, if the identified file has been archived but is not longer stored in the node; a telephone call to the derived call number is likely to reach an operator who can provide the identified file. Furthermore, call forwarding information can be provided at the node if the associated telephone terminal has been changed. Decomposition routine 52 generates, in response to a provided identifier generated as described above, the denominated time closest to the time when the event occurred. This information is frequently desired by users of data processing devices. Finally, decomposition routine 54 generates, in response to a provided identifier generated as described above, signals representing the characteristic or type of the event. This information is useful in the internal operation of the device; for example, a program branch can be conditioned on the event characteristic.

Claims (3)

What is claimed is:
1. In a data processing node, at which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
identifier means for generating a unique identifier signal for a qualifying event having a characteristic, comprising
storage means,
node number means for providing signals representing a predetermined number, and storing said signals in said storage means
time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x,
event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for provding an event signal,
generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage,
identifier signal presenting means comprising input/output means and network interface means,
analysis means responsive to a previously generated event identifier signal presented at said identifier presenting means, comprising
first decomposing means for generating node number signals representing the node number stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated,
second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and
third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said presented event identifier signal.
2. In a network of data processing nodes, at each of which successive qualifying events can occur at time intervals no smaller than x, an improvement comprising:
at each said node, identifier means for generating a unique identifier signal for a qualifying event having a characteristic, comprising
storage means,
node number means for providing signals representing a predetermined number, and storing said signals in said storage means,
time signal means for providing time signals indicative of distinctly denominated times, any two successive denominated times being separated by a time interval smaller than x,
event signal means responsive to occurrence of one of said qualifying events and to a characteristic of said one event for providing an event signal,
generating means connected to said storage means, said time signal means, and said event signal means and responsive to a said event signal, to said stored node number signals and to said time signals indicative of the one of said denominated times minimally distant from the time of provision of said event signal, for generating an identifier signal associated with said event and indicative of said event characteristic, and for storing said identifier signal in said storage, and
in at least one said node, identifier signal presenting means, comprising input/output means and network interface means, for presenting a previously generated identifier signal, and
analysis means for decomposing a said identifier signal presented at said identifier presenting means, comprising
first decomposing means for generating node number signals stored, at the time of occurrence of the event identified by said presented identifier signal, at the node at which said presented event identifier signal was generated,
second decomposing means for generating time signals indicative of the denominated time minimally distant from the time of occurrence of the event identified by said presented event identifier signal, and
third decomposing means for generating event characteristic signals indicative of a characteristic of the event identified by said present event identifier signal.
3. The improvement of claim 1, further comprising fiduciary time means for relating said time signals to a real time standard.
US06/841,070 1986-03-18 1986-03-18 Network event identifiers Expired - Lifetime US4792921A (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
US06/841,070 US4792921A (en) 1986-03-18 1986-03-18 Network event identifiers
JP61296497A JPH0797347B2 (en) 1986-03-18 1986-12-12 Network event identification device
CA000532232A CA1257419A (en) 1986-03-18 1987-03-17 Network event identifiers
AU70090/87A AU591551B2 (en) 1986-03-18 1987-03-17 Network event identifiers
EP87103838A EP0238039B2 (en) 1986-03-18 1987-03-17 Network event identifiers
DE3782349T DE3782349T3 (en) 1986-03-18 1987-03-17 Network event identification devices.

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US06/841,070 US4792921A (en) 1986-03-18 1986-03-18 Network event identifiers

Publications (1)

Publication Number Publication Date
US4792921A true US4792921A (en) 1988-12-20

Family

ID=25283943

Family Applications (1)

Application Number Title Priority Date Filing Date
US06/841,070 Expired - Lifetime US4792921A (en) 1986-03-18 1986-03-18 Network event identifiers

Country Status (6)

Country Link
US (1) US4792921A (en)
EP (1) EP0238039B2 (en)
JP (1) JPH0797347B2 (en)
AU (1) AU591551B2 (en)
CA (1) CA1257419A (en)
DE (1) DE3782349T3 (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5117351A (en) * 1988-10-21 1992-05-26 Digital Equipment Corporation Object identifier generator for distributed computer system
US5155850A (en) * 1990-02-23 1992-10-13 International Business Machines Corporation Method and system for maintaining a time frame selective document history log in a data processing system
US5202982A (en) * 1990-03-27 1993-04-13 Sun Microsystems, Inc. Method and apparatus for the naming of database component files to avoid duplication of files
WO1995032463A1 (en) * 1994-05-19 1995-11-30 Ontos, Inc. A system for generating globally unique object indentities
US5627996A (en) * 1992-08-19 1997-05-06 At&T Method and apparatus for accessing the same computer file using different file name formats
US5884322A (en) * 1994-05-24 1999-03-16 Apple Computer, Inc. Method and apparatus for creating and assigning unique identifiers for network entities and database items in a networked computer system
EP0919960A1 (en) * 1997-03-24 1999-06-02 Akira Sugiyama System for issuing authentication data based on a specific time, medium for storing authentication data issued by the issuing system and system for authenticating authentication data
US6542907B1 (en) 2000-03-31 2003-04-01 International Business Machines Corporation Method and apparatus for decentralized, invertible generation of bounded-length globally unique replica identifiers
US6553403B1 (en) 1998-06-03 2003-04-22 International Business Machines Corporation System, method and computer program product for monitoring in a distributed computing environment
US7376722B1 (en) 1999-08-06 2008-05-20 Red Sheriff Limited Network resource monitoring and measurement system and method
US7386473B2 (en) 1996-09-03 2008-06-10 Nielsen Media Research, Inc. Content display monitoring by a processing system
US7406516B2 (en) 1997-03-21 2008-07-29 Netratings, Inc. System and method for monitoring the use of a resource by a client connected to a computer network having one or more servers in communication with one or more clients
US20080300965A1 (en) * 2007-05-31 2008-12-04 Peter Campbell Doe Methods and apparatus to model set-top box data
US8271778B1 (en) 2002-07-24 2012-09-18 The Nielsen Company (Us), Llc System and method for monitoring secure data on a network
US8661111B1 (en) 2000-01-12 2014-02-25 The Nielsen Company (Us), Llc System and method for estimating prevalence of digital content on the world-wide-web
US9185435B2 (en) 2013-06-25 2015-11-10 The Nielsen Company (Us), Llc Methods and apparatus to characterize households with media meter data
US9277265B2 (en) 2014-02-11 2016-03-01 The Nielsen Company (Us), Llc Methods and apparatus to calculate video-on-demand and dynamically inserted advertisement viewing probability
US9848224B2 (en) 2015-08-27 2017-12-19 The Nielsen Company(Us), Llc Methods and apparatus to estimate demographics of a household
US10219039B2 (en) 2015-03-09 2019-02-26 The Nielsen Company (Us), Llc Methods and apparatus to assign viewers to media meter data
US10791355B2 (en) 2016-12-20 2020-09-29 The Nielsen Company (Us), Llc Methods and apparatus to determine probabilistic media viewing metrics

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19524405C2 (en) * 1995-07-04 1997-10-02 Siemens Ag Call data acquisition procedure
JP4074998B2 (en) * 2001-12-17 2008-04-16 ソニー株式会社 Data communication system, data communication apparatus, and data communication method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4558413A (en) * 1983-11-21 1985-12-10 Xerox Corporation Software version management system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4559416A (en) * 1983-10-12 1985-12-17 Morgan Industries, Inc. Telephone line activity monitor

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4558413A (en) * 1983-11-21 1985-12-10 Xerox Corporation Software version management system

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
Crabtree, R. P., "Qualification of Network Name With Job Name"and "Multi-Level Network Name", and "Software Serial Number." IBM Technical Disclosure Bulletin, vol. 26, No. 7B, (Dec. 1983), pp. 3915-3919.
Crabtree, R. P., Qualification of Network Name With Job Name and Multi Level Network Name , and Software Serial Number. IBM Technical Disclosure Bulletin, vol. 26, No. 7B, (Dec. 1983), pp. 3915 3919. *
Holzner, S. "Chapter 5, The Disk in Your PC,", In Creating Utilities With Assembly Language, (New York, Brady Communications Company, Inc., 1986), pp. 43-44.
Holzner, S. Chapter 5, The Disk in Your PC, , In Creating Utilities With Assembly Language, (New York, Brady Communications Company, Inc., 1986), pp. 43 44. *
Norton, P. "Chapter 5/An Overview of Elementary Commands", In: PC-DOS, Introduction to High Performance Computing, (Bowie, Maryland, Brady Communications Company, Inc., 1985), p. 42.
Norton, P. Chapter 5/An Overview of Elementary Commands , In: PC DOS, Introduction to High Performance Computing, (Bowie, Maryland, Brady Communications Company, Inc., 1985), p. 42. *

Cited By (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5117351A (en) * 1988-10-21 1992-05-26 Digital Equipment Corporation Object identifier generator for distributed computer system
US5155850A (en) * 1990-02-23 1992-10-13 International Business Machines Corporation Method and system for maintaining a time frame selective document history log in a data processing system
US5202982A (en) * 1990-03-27 1993-04-13 Sun Microsystems, Inc. Method and apparatus for the naming of database component files to avoid duplication of files
US5627996A (en) * 1992-08-19 1997-05-06 At&T Method and apparatus for accessing the same computer file using different file name formats
WO1995032463A1 (en) * 1994-05-19 1995-11-30 Ontos, Inc. A system for generating globally unique object indentities
US5522077A (en) * 1994-05-19 1996-05-28 Ontos, Inc. Object oriented network system for allocating ranges of globally unique object identifiers from a server process to client processes which release unused identifiers
US5884322A (en) * 1994-05-24 1999-03-16 Apple Computer, Inc. Method and apparatus for creating and assigning unique identifiers for network entities and database items in a networked computer system
US7386473B2 (en) 1996-09-03 2008-06-10 Nielsen Media Research, Inc. Content display monitoring by a processing system
US7716326B2 (en) 1996-09-03 2010-05-11 The Nielsen Company (Us), Llc. Content display monitor
US7756974B2 (en) 1996-09-03 2010-07-13 The Nielsen Company (Us), Llc. Content display monitor
US7720963B2 (en) 1996-09-03 2010-05-18 The Nielsen Company (Us), Llc Content display monitor
US8719698B2 (en) 1996-09-03 2014-05-06 Comscore, Inc. Content display monitor
US7720964B2 (en) 1996-09-03 2010-05-18 The Nielsen Company (Us), Llc Content display monitor
US8769394B2 (en) 1996-09-03 2014-07-01 Comscore, Inc. Content display monitor
US8713428B2 (en) 1996-09-03 2014-04-29 Comscore, Inc. Content display monitor
US7590568B2 (en) 1996-09-03 2009-09-15 The Nielsen Company (Us), Llc Content display monitor
US7613635B2 (en) 1996-09-03 2009-11-03 The Nielsen Company (Us), Llc Content display monitor
US7644156B2 (en) 1996-09-03 2010-01-05 The Nielsen Company(US), LLC. Content display monitor
US7650407B2 (en) 1996-09-03 2010-01-19 The Nielsen Company (Us), Llc. Content display monitor
US7653724B2 (en) 1996-09-03 2010-01-26 The Nielsen Company (Us), Llc. Content display monitor
US7406516B2 (en) 1997-03-21 2008-07-29 Netratings, Inc. System and method for monitoring the use of a resource by a client connected to a computer network having one or more servers in communication with one or more clients
EP0919960A1 (en) * 1997-03-24 1999-06-02 Akira Sugiyama System for issuing authentication data based on a specific time, medium for storing authentication data issued by the issuing system and system for authenticating authentication data
EP0919960A4 (en) * 1997-03-24 2004-08-25 Akira Sugiyama System for issuing authentication data based on a specific time, medium for storing authentication data issued by the issuing system and system for authenticating authentication data
US6553403B1 (en) 1998-06-03 2003-04-22 International Business Machines Corporation System, method and computer program product for monitoring in a distributed computing environment
US7953839B2 (en) 1999-08-06 2011-05-31 The Nielsen Company (Us), Llc. Network resource monitoring and measurement system and method
US7376722B1 (en) 1999-08-06 2008-05-20 Red Sheriff Limited Network resource monitoring and measurement system and method
US8112511B2 (en) 1999-08-06 2012-02-07 The Nielsen Company (Us), Llc Network resource monitoring and measurement system and method
US9992092B2 (en) 1999-08-06 2018-06-05 Comscore, Inc. Network resource monitoring and measurement system and method
US8495198B2 (en) 1999-08-06 2013-07-23 Comscore, Inc. Network resource monitoring and measurement system and method
US7953791B2 (en) 1999-08-06 2011-05-31 The Nielsen Company (Us), Llc. Network resource monitoring and measurement system and method
US9514479B2 (en) 2000-01-12 2016-12-06 The Nielsen Company (Us), Llc System and method for estimating prevalence of digital content on the world-wide-web
US8661111B1 (en) 2000-01-12 2014-02-25 The Nielsen Company (Us), Llc System and method for estimating prevalence of digital content on the world-wide-web
US6542907B1 (en) 2000-03-31 2003-04-01 International Business Machines Corporation Method and apparatus for decentralized, invertible generation of bounded-length globally unique replica identifiers
US8271778B1 (en) 2002-07-24 2012-09-18 The Nielsen Company (Us), Llc System and method for monitoring secure data on a network
US9401897B2 (en) 2002-07-24 2016-07-26 The Nielsen Company (Us), Llc. System and method for monitoring secure data on a network
US8799643B2 (en) 2002-07-24 2014-08-05 The Nielsen Company (Us), Llc System and method for monitoring secure data on a network
US20080300965A1 (en) * 2007-05-31 2008-12-04 Peter Campbell Doe Methods and apparatus to model set-top box data
US9185435B2 (en) 2013-06-25 2015-11-10 The Nielsen Company (Us), Llc Methods and apparatus to characterize households with media meter data
US9277265B2 (en) 2014-02-11 2016-03-01 The Nielsen Company (Us), Llc Methods and apparatus to calculate video-on-demand and dynamically inserted advertisement viewing probability
US9544632B2 (en) 2014-02-11 2017-01-10 The Nielsen Company (Us), Llc Methods and apparatus to calculate video-on-demand and dynamically inserted advertisement viewing probability
US9774900B2 (en) 2014-02-11 2017-09-26 The Nielsen Company (Us), Llc Methods and apparatus to calculate video-on-demand and dynamically inserted advertisement viewing probability
US10219039B2 (en) 2015-03-09 2019-02-26 The Nielsen Company (Us), Llc Methods and apparatus to assign viewers to media meter data
US10757480B2 (en) 2015-03-09 2020-08-25 The Nielsen Company (Us), Llc Methods and apparatus to assign viewers to media meter data
US11516543B2 (en) 2015-03-09 2022-11-29 The Nielsen Company (Us), Llc Methods and apparatus to assign viewers to media meter data
US11785301B2 (en) 2015-03-09 2023-10-10 The Nielsen Company (Us), Llc Methods and apparatus to assign viewers to media meter data
US9848224B2 (en) 2015-08-27 2017-12-19 The Nielsen Company(Us), Llc Methods and apparatus to estimate demographics of a household
US10298982B2 (en) 2015-08-27 2019-05-21 The Nielsen Company (Us), Llc Methods and apparatus to estimate demographics of a household
US10924791B2 (en) 2015-08-27 2021-02-16 The Nielsen Company (Us), Llc Methods and apparatus to estimate demographics of a household
US11700405B2 (en) 2015-08-27 2023-07-11 The Nielsen Company (Us), Llc Methods and apparatus to estimate demographics of a household
US10791355B2 (en) 2016-12-20 2020-09-29 The Nielsen Company (Us), Llc Methods and apparatus to determine probabilistic media viewing metrics
US11778255B2 (en) 2016-12-20 2023-10-03 The Nielsen Company (Us), Llc Methods and apparatus to determine probabilistic media viewing metrics

Also Published As

Publication number Publication date
AU591551B2 (en) 1989-12-07
EP0238039B2 (en) 1997-04-16
AU7009087A (en) 1987-09-24
DE3782349D1 (en) 1992-12-03
EP0238039A2 (en) 1987-09-23
DE3782349T3 (en) 1997-10-30
DE3782349T2 (en) 1993-05-19
JPS62221246A (en) 1987-09-29
EP0238039B1 (en) 1992-10-28
EP0238039A3 (en) 1989-05-31
CA1257419A (en) 1989-07-11
JPH0797347B2 (en) 1995-10-18

Similar Documents

Publication Publication Date Title
US4792921A (en) Network event identifiers
US11138219B2 (en) Database management system, database management method, and database management program
US5345586A (en) Method and system for manipulation of distributed heterogeneous data in a data processing system
KR100712569B1 (en) System and method for selectively defining accesss to application features
US5905890A (en) Event architecture for system management in an operating system
US4479196A (en) Hyperedge entity-relationship data base systems
US6487469B1 (en) System and method for integrating schedule and design environments
US4646229A (en) Time-ordered data base
US4979109A (en) Method of controlling a data dictionary directory system in a data base system
JP2901081B2 (en) How to rename non-leaf entries in OSI directory
CN110781183A (en) Method and device for processing incremental data in Hive database and computer equipment
US6675157B1 (en) System and method for balancing binary search trees
US6286025B1 (en) Method and system of process identification by user defined process variables
US20040015520A1 (en) Database managing method and system having data backup function and associated programs
US5216604A (en) Method and system for editing data by limiting current operations in accordance with previous operations
JP2644535B2 (en) Network file search processing system
EP0394172A2 (en) Method of performing file services given partial file names
JPH096663A (en) How to maintain distributed link information
JP2000032512A (en) Structuring method of operator service database
JP2002533829A (en) Method and apparatus for user extensible event structure
KR19980043212A (en) Method of generating relation-domain-information data of mobile switching center
JPH09274590A (en) Data processor
KR940009110B1 (en) Universal control method of test systems for conformity assessment process (CAP)
JPH11224215A (en) File management method/device
JPH052520A (en) Data base system

Legal Events

Date Code Title Description
AS Assignment

Owner name: WANG LABORATORIES, INC., ONE INDUSTRIAL AVENUE, LO

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:CORWIN, DANIEL W.;REEL/FRAME:004529/0059

Effective date: 19860318

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: FIRST NATIONAL BANK OF BOSTON, MASSACHUSETTS

Free format text: SECURITY INTEREST;ASSIGNOR:WANG LABORATORIES, INC.;REEL/FRAME:005296/0001

Effective date: 19890915

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: WANG LABORATORIES, INC., MASSACHUSETTS

Free format text: TERMINATION OF SECURITY INTEREST;ASSIGNOR:FIRST NATIONAL BANK OF BOSTON, AS TRUSTEE;REEL/FRAME:006932/0001

Effective date: 19930830

Owner name: CONGRESS FINANCIAL CORPORATION (NEW ENGLAND), MASS

Free format text: SECURITY INTEREST;ASSIGNOR:WANG LABORATORIES, INC.;REEL/FRAME:006932/0047

Effective date: 19931220

AS Assignment

Owner name: WANG LABORATORIES, INC., MASSACHUSETTS

Free format text: RELEASE OF SECURITY INTEREST IN AND REASSIGNMENT OF U.S. PATENTS AND PATENT APPLICATIONS;ASSIGNOR:CONGRESS FINANCIAL CORPORATION (NEW ENGLAND);REEL/FRAME:007341/0041

Effective date: 19950130

AS Assignment

Owner name: BT COMMERCIAL CORPORATION (AS AGENT), NEW YORK

Free format text: SECURITY INTEREST;ASSIGNOR:WANG LABORATORIES, INC.;REEL/FRAME:007377/0072

Effective date: 19950130

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: BT COMMERICAL CORPORATION, NEW YORK

Free format text: SECURITY AGREEMENT;ASSIGNOR:WANG LABORATORIES, INC.;REEL/FRAME:008246/0001

Effective date: 19960828

AS Assignment

Owner name: AMIGA DEVELOPMENT, LLC, SOUTH DAKOTA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WANG LABORATORIES, INC.;REEL/FRAME:009845/0659

Effective date: 19980515

FPAY Fee payment

Year of fee payment: 12

OSZAR »