← Back to Patent Explorer
US6085328A Expired / Lapsed US ⏱️ 0.0 years remaining

Wake up of a sleeping computer using I/O snooping and imperfect packet filtering

Assignee: Hewlett Packard Enterprise Development LP
•
Filing: 1998-01-20
•
Granted: 2000-07-04
•
Expires: 2018-01-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A reliable and simple means to awaken sleeping computers is to maintain the network interface subsystem at full power, and to filter detected packets so that when desired packets are detected, full power is restored to the entire computer. An interface to connect a computer to a network is provided, where, the computer has a high power state and a low power state, and the computer is capable of normal operation when in the high power state, and the computer is substantially inactivated when in the low power state. A packet is received from the network. The packet is filtered by computing a hash function using at least one byte selected from the packet. A transition is initiated, responsive to a result of filtering the packet, to transition the computer from the low power state to the high power state. A mask may be used to select the at least one byte. Several bytes may be selected by the mask. A first register may be used to hold the mask. A second register may be used to hold a desired result of the hash function calculation. A result of the hash function calculation is compared with a contents of the second register to determine whether or not the result of the hash function calculation matches the contents of the second register. A perfect filtering or a second hash function filtering may be combined by AND or NOT logical operations, in making the decision whether or not to awaken the computer.

Inventors

  • 👤 Philippe Klein
  • 👤 Simoni Ben-Michael

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 16:46
CPC Classifications
G; G06; G06F; G06F1/00; G06F1/26; G06F1/32; G06F1/3203; G06F1/3206; G06F1/3209; H; H04; H04L; H04L12/00; H04L12/02; H04L12/12; Y; Y02; Y02D; Y02D30/00; Y02D30/50

Claims Analysis

Total Claims: 28
Claim 1
Independent Claim 152 words
An interface suitable for connecting a computer to a network, the computer having a high-power operational state and a low-power operational state, said interface comprising: filtering means for selectively passing a data packet sent by the network, said filtering means comprising, at least one hash value; at least one offset value; at least one mask corresponding to said at least one offset value; means for selecting a portion of said data packet, said selected data packet portion specified by said at least one offset value and said at least one mask; means for deriving a hash function from said selected data packet portion; means for comparing said derived hash function with said at least one hash value; and switching means responsive to said filtering means, for initiating a transition of the computer between the low-power state and the high-power state if said derived hash function matches said at least one hash value.
Claim 2
Dependent Claim 152 words
An interface suitable for connecting a computer to a network, the computer having a high-power operational state and a low-power operational state, said interface comprising: filtering means for selectively passing a data packet sent by the network, said filtering means comprising, at least one hash value; at least one offset value; at least one mask corresponding to said at least one offset value; means for selecting a portion of said data packet, said selected data packet portion specified by said at least one offset value and said at least one mask; means for deriving a hash function from said selected data packet portion; means for comparing said derived hash function with said at least one hash value; and switching means responsive to said filtering means, for initiating a transition of the computer between the low-power state and the high-power state if said derived hash function matches said at least one hash value.
Claim 3
Dependent Claim 19 words
The interface of claim 1 further comprising means for performing an adjustment of said at least one offset value.
Claim 4
Dependent Claim 21 words
The interface of claim 2 wherein said means for performing an adjustment is responsive to the format of said data packet.
Claim 5
Dependent Claim 48 words
The interface of claim 1 wherein said data packet comprises a plurality of bytes and said means for selecting a portion of said data packet functions by using said at least one offset value to define a first said byte for inclusion in said selected data packet portion.
Claim 6
Dependent Claim 42 words
The interface of claim 4 wherein said means for selecting a portion of said data packet further functions by using said at least one mask to define at least one portion of said bytes for inclusion in said selected data packet portion.
Claim 7
Dependent Claim 19 words
The interface of claim 1 further comprising means for loading said at least one hash value into a register.
Claim 8
Dependent Claim 18 words
The interface of claim 1 further comprising at least one command associated with said at least one mask.
Claim 9
Dependent Claim 26 words
The interface of claim 7 wherein said at least one command functions to combine said at least one mask with at least one other said mask.
Claim 10
Dependent Claim 21 words
The interface of claim 7 wherein said at least one command functions to indicate the destination type of said data packet.
Claim 11
Dependent Claim 26 words
The interface of claim 9 wherein said data packet destination type comprises a member of the group consisting of a broadcast packet and a unicast packet.
Claim 12
Dependent Claim 23 words
The interface of claim 7 wherein said at least one command functions to reverse the logic of said at least one hash value.
Claim 13
Dependent Claim 19 words
The interface of claim 7 wherein said at least one command functions to enable said at least one mask.
Claim 14
Dependent Claim 23 words
The interface of claim 1 wherein said means for deriving a hash function comprises means for performing a 32-bit cyclic redundancy check computation.
Claim 15
Dependent Claim 23 words
The interface of claim 1 wherein said means for deriving a hash function comprises means for performing a 16-bit cyclic redundancy check computation.
Claim 16
Dependent Claim 21 words
The interface of claim 7 wherein said switching means comprises means for initiating a boot up power cycle for the computer.
Claim 17
Independent Claim 122 words
An method for interfacing a computer with a network, the computer having a high-power operational state and a low-power operational state, said method comprising the steps of: obtaining a hash value; obtaining an offset value; obtaining a mask corresponding to said offset value; detecting a data packet sent by the network, said data packet comprising a plurality of bytes; filtering said data packet by means of said mask and said offset value to yield a portion of the data packet; deriving a hash function from said data packet portion; comparing said derived hash function with said hash value; and if said derived hash function matches said hash value, initiating a transition of the computer between the low-power state and the high-power state.
Claim 18
Independent Claim 122 words
An method for interfacing a computer with a network, the computer having a high-power operational state and a low-power operational state, said method comprising the steps of: obtaining a hash value; obtaining an offset value; obtaining a mask corresponding to said offset value; detecting a data packet sent by the network, said data packet comprising a plurality of bytes; filtering said data packet by means of said mask and said offset value to yield a portion of the data packet; deriving a hash function from said data packet portion; comparing said derived hash function with said hash value; and if said derived hash function matches said hash value, initiating a transition of the computer between the low-power state and the high-power state.
Claim 19
Dependent Claim 32 words
The method of claim 16 further comprising the step of adjusting said offset value in response to the format of the data packet prior to said step of filtering said data packet.
Claim 20
Dependent Claim 33 words
The method of claim 16 wherein said step of filtering said data packet comprises the step of using said offset value to define a first byte for inclusion in said data packet portion.
Claim 21
Dependent Claim 35 words
The method of claim 18 wherein said step of filtering said data packet further comprises the step of using said mask to define a portion of said bytes for inclusion in said data packet portion.
Claim 22
Dependent Claim 35 words
The method of claim 18 further comprising the steps of: obtaining a command associated with said mask; and modifying said mask in accordance with said command prior to said step of filtering said data packet.
Claim 23
Dependent Claim 42 words
The method of claim 20 wherein said step of modifying said mask in accordance with said command comprises the steps of: obtaining a second mask; and combining said mask with said second mask prior to said step of filtering said data packet.
Claim 24
Dependent Claim 27 words
The method of claim 16 further comprising the step of determining the destination type of data packet to be either a broadcast packet or a unicast packet.
Claim 25
Dependent Claim 26 words
The method of claim 16 further comprising the step of reversing the logic of said hash value subsequent to said step of obtaining a hash value.
Claim 26
Dependent Claim 24 words
The method of claim 16 wherein said step of deriving a hash function comprises the step of performing a 16-bit cyclic redundancy check computation.
Claim 27
Dependent Claim 24 words
The method of claim 16 wherein said stop of deriving a hash function comprises the step of performing a 32-bit cyclic redundancy check computation.
Claim 28
Dependent Claim 28 words
The method of claim 16 wherein said step of initiating a transition of the computer comprises the step of initiating a boot up power cycle for the computer.

References Cited (Backward Citations)

US5842224A Cited
US5012233A Cited
US5396636A Cited
US5473607A Cited
US5381414A Cited
US5884025A Cited
US5809313A Cited
US5742833A Cited
US5802305A Cited
US5915119A Cited
US5848233A Cited
US5887131A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-07-04 2004-01-03 2004-07-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-07-04 2008-01-03 2008-07-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-07-04 2012-01-03 2012-07-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag