Patents by Inventor Peter Key

Peter Key has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11927807
    Abstract: According to various aspects of the present disclosure, an apparatus is provided. In an aspect, the apparatus includes an optical transceiver having a first port, a second port and an optical switch coupled to the first port and the second port. The optical switch is switchable between a unidirectional port operation mode and a bidirectional port operation mode. When the optical switch is in the unidirectional port operation mode, the first port is configured to send a first optical signal, and the second port configured to receive a second optical signal. When the optical switch is in the bidirectional port operation mode, the first port configured to send the first optical signal and receive the second optical signal, and the second port configured to receive a third optical signal and not send the first signal.
    Type: Grant
    Filed: November 29, 2022
    Date of Patent: March 12, 2024
    Assignee: Juniper Networks, Inc.
    Inventors: Kevan Peter Jones, Robert William Keys
  • Patent number: 10021462
    Abstract: According to one configuration, to test an encoder resource, a user controls operation of both a mobile communication device and a corresponding video management device. For example, the user inputs a command to a test control application executing on the mobile communication device to test encoding of content by the encoder resource. In response to receiving the input command to test a target encoder resource, the test control application on the mobile communication device transmits video information from the mobile communication device to in the video management device. The video management device processes the video information received from the mobile communication device. Using the video information, the video management device derives and outputs a corresponding coded video stream to the encoder resource under test. As its name suggests, the encoder resource encodes the received video stream and transmits it over an assigned channel in a shared communication link.
    Type: Grant
    Filed: March 16, 2016
    Date of Patent: July 10, 2018
    Assignee: Time Warner Cable Enterprises LLC
    Inventor: Peter Keys
  • Publication number: 20170272831
    Abstract: According to one configuration, to test an encoder resource, a user controls operation of both a mobile communication device and a corresponding video management device. For example, the user inputs a command to a test control application executing on the mobile communication device to test encoding of content by the encoder resource. In response to receiving the input command to test a target encoder resource, the test control application on the mobile communication device transmits video information from the mobile communication device to in the video management device. The video management device processes the video information received from the mobile communication device. Using the video information, the video management device derives and outputs a corresponding coded video stream to the encoder resource under test. As its name suggests, the encoder resource encodes the received video stream and transmits it over an assigned channel in a shared communication link.
    Type: Application
    Filed: March 16, 2016
    Publication date: September 21, 2017
    Inventor: Peter Keys
  • Publication number: 20140278944
    Abstract: Methods, computer systems, and computer-storage media are provided for ranking ads. A reserve price is included in a calculation of a score to rank one or more advertisements for display. The calculation may further rely on a bid submitted by an advertiser for an advertisement, a click probability associated with the advertisement, a relevance of the advertisement to a search query and/or user, and the like. Once the reserve price is used to establish a score for one or more advertisements, a price is calculated for each of the one or more advertisements. The one or more advertisements may be displayed in an order indicated by the scores of each of the advertisements.
    Type: Application
    Filed: March 13, 2013
    Publication date: September 18, 2014
    Applicant: MICROSOFT CORPORATION
    Inventors: IAN KASH, DINAN SRILAL GUNAWARDENA, PETER KEY, BEN ROBERTS, THOMAS BORCHERT, OMER HAR
  • Patent number: 8340099
    Abstract: Control of background data transfers is described. In an embodiment, a background data transfer is controlled at a receiver node by measuring a time period taken to receive from a sender node a data sequence of the same size as a receive window. The time period is used to evaluate available network capacity, and the network capacity used to calculate a new window size. The new window size is applied and communicated to the sender node. In another embodiment, a background data transfer is controlled at a receiver node by measuring a quantity of data received from a sender node during a first control interval. The measured quantity is used to evaluate available network capacity, and the network capacity used to calculate a new receive window size and a second control interval duration. The new window size is applied for the second control interval, and communicated to the sender node.
    Type: Grant
    Filed: July 15, 2009
    Date of Patent: December 25, 2012
    Assignee: Microsoft Corporation
    Inventors: Richard John Black, Dinan Gunawardena, Peter Key, Gregory O'Shea
  • Patent number: 8059541
    Abstract: An end-host based network management system and methods are described. The methods are performed independently at each end-host within the network based on data on local flows which is shared between end-hosts. In an embodiment, an end-host shares data on constrained local flows with other end-hosts and receives such data from other end-hosts. Based on this data, the end-host determines which flows from other nodes are competing for a shared resource with a constrained local flow and allocates the capacity of the shared resource between all the competing flows. This allocation is then enforced for the local flow by the end-host. Other end-hosts with competing flows perform similar methods and through an iterative process the contention for the shared resource is resolved and the utilization of the shared resource is optimized.
    Type: Grant
    Filed: May 22, 2008
    Date of Patent: November 15, 2011
    Assignee: Microsoft Corporation
    Inventors: Thomas Karagiannis, Christos Gkantsidis, Peter Key, Elias Athanasopoulos
  • Publication number: 20110013516
    Abstract: Control of background data transfers is described. In an embodiment, a background data transfer is controlled at a receiver node by measuring a time period taken to receive from a sender node a data sequence of the same size as a receive window. The time period is used to evaluate available network capacity, and the network capacity used to calculate a new window size. The new window size is applied and communicated to the sender node. In another embodiment, a background data transfer is controlled at a receiver node by measuring a quantity of data received from a sender node during a first control interval. The measured quantity is used to evaluate available network capacity, and the network capacity used to calculate a new receive window size and a second control interval duration. The new window size is applied for the second control interval, and communicated to the sender node.
    Type: Application
    Filed: July 15, 2009
    Publication date: January 20, 2011
    Applicant: Microsoft Corporation
    Inventors: Richard John Black, Dinan Gunawardena, Peter Key, Gregory O'Shea
  • Publication number: 20090290491
    Abstract: An end-host based network management system and methods are described. The methods are performed independently at each end-host within the network based on data on local flows which is shared between end-hosts. In an embodiment, an end-host shares data on constrained local flows with other end-hosts and receives such data from other end-hosts. Based on this data, the end-host determines which flows from other nodes are competing for a shared resource with a constrained local flow and allocates the capacity of the shared resource between all the competing flows. This allocation is then enforced for the local flow by the end-host. Other end-hosts with competing flows perform similar methods and through an iterative process the contention for the shared resource is resolved and the utilization of the shared resource is optimized.
    Type: Application
    Filed: May 22, 2008
    Publication date: November 26, 2009
    Applicant: Microsoft Corporation
    Inventors: Thomas Karagiannis, Christos Gkantsidis, Peter Key, Elias Athanasopoulos
  • Publication number: 20080219285
    Abstract: There is a need to improve design of communications protocols in which two or more channels are provided and, optionally, in which collision avoidance is not available. An improved protocol is provided in which communications nodes pick a channel on which to transmit and collisions may occur where two nodes attempt to transmit on the same channel. The node currently occupying a channel is arranged to have a specified probability of holding onto that channel as compared to a newcomer. Other methods are described whereby a node is able to occupy more than one channel at the same time and whereby nodes each occupy approximately the same number of channels.
    Type: Application
    Filed: March 8, 2007
    Publication date: September 11, 2008
    Applicant: Microsoft Corporation
    Inventors: Peter Key, Ayalvadi Ganesh, Ashvin Lakshmikantha
  • Publication number: 20070289228
    Abstract: The present invention relates generally to a building or shelter system 10 comprising a series of structures or modular frames 12A to 12F being arranged generally parallel to and laterally spaced from one another and interconnected with roof sheeting 14. The modular frames such as 12A are each in their erected condition in the form of a roof truss each including a plurality of constructional modules or truss modules or panels such as 16A and 16B. The truss modules or panels such as 16A are each shaped in the form of a trapezium including upper and lower substantially parallel chord members 18 and 20, respectively, which are interconnected at opposite ends with web members 22 and 24. the structure or module frame 12A includes conditioning elements arranged to cooperate with the constructional modules or truss panels such as 16A and 16B to form the module frame 12A.
    Type: Application
    Filed: March 30, 2005
    Publication date: December 20, 2007
    Inventor: Peter Key
  • Patent number: 7284047
    Abstract: A method and system for avoiding network congestion by measuring network load to adjust a rate at each source. The load (e.g., as a price value) is provided to network traffic sources, which adjust their flows based on a per-flow weight (willingness to pay). The load may be determined in-band by routers or out-of-band by an observer node. A load value (e.g., as a price) is increased or decreased based on the actual load or an estimate based on the actual load. The sources obtain the load value and control the output rates per flow based on each flow's associated weight (willingness to pay), e.g., as set by an administrator. Further, two classes of applications are enabled by allowing certain applications to ignore price.
    Type: Grant
    Filed: November 8, 2001
    Date of Patent: October 16, 2007
    Assignee: Microsoft Corporation
    Inventors: Paul Barham, Richard Black, Peter Key, Neil Stratford
  • Publication number: 20060114825
    Abstract: Network congestion avoidance within aggregated channels is disclosed. In one embodiment, a method first transmits a packet associated with a first channel of a plurality of related channels from a source protocol layer (e.g., a source IP layer) of a source through a network (e.g., the Internet). Next, the method triggers an ECN event by the packet at the network. Finally, at least one channel is determined to have decreased packets transmitted therethrough, in response to the triggering of the ECN event (e.g., based on a congestion pricing criteria).
    Type: Application
    Filed: January 19, 2006
    Publication date: June 1, 2006
    Applicant: Microsoft Corporation
    Inventors: Derek McAuley, Paul Barham, Peter Key, Koenraad Laevens
  • Patent number: 7023800
    Abstract: Network congestion avoidance within aggregated channels is disclosed. In one embodiment, a method first transmits a packet associated with a first channel of a plurality of related channels from a source protocol layer (e.g., a source IP layer) of a source through a network (e.g., the Internet). Next, the method triggers an ECN event by the packet at the network. Finally, at least one channel is determined to have decreased packets transmitted therethrough, in response to the triggering of the ECN event (e.g., based on a congestion pricing criteria).
    Type: Grant
    Filed: June 1, 1999
    Date of Patent: April 4, 2006
    Assignee: Microsoft Corporation
    Inventors: Derek McAuley, Paul R. Barham, Peter Key, Koenraad Laevens
  • Publication number: 20050071451
    Abstract: In an application-level background transport service, a receiver node infers the available network capacity between itself and a sender node over a control interval. Based on the inferred available network capacity, the receiver node adjusts its receive window size accordingly in order to conservatively optimize the bandwidth used by a background transfer without degrading performance of other foreground transfers on the network. The adjusted receive window size is communicated to the sender node, which is likely to adjust its send window size based on the adjusted receive window size.
    Type: Application
    Filed: September 30, 2003
    Publication date: March 31, 2005
    Inventors: Peter Key, Laurent Massoulie, Bing Wang
  • Publication number: 20050030904
    Abstract: Substantially accurate estimation of coordinates of a subject network node in a coordinate space is accomplished by considering designated coordinates of other positioned nodes within the network. The designation of coordinates in the coordinate space to such nodes allows the computation of predicted coordinate distances between two network nodes based on the coordinates. By optimizing the network distance errors between measured distances and predicted coordinate distances, the predicted coordinates of a subject node joining the network can be iteratively refined. With these estimated coordinates, the coordinate distance between two points in the space may be computed as a prediction of the network distance between the two corresponding nodes. Furthermore, coordinate-based coordinate estimation lends itself to security precautions to protect against malicious reference nodes or external interference.
    Type: Application
    Filed: September 1, 2004
    Publication date: February 10, 2005
    Applicant: Microsoft Corporation
    Inventors: Miguel Oom Temudo de Castro, Manuel da Silva Costa, Peter Key, Antony Rowstron
  • Publication number: 20030097461
    Abstract: A method and system for avoiding network congestion by measuring network load to adjust a rate at each source. The load (e.g., as a price value) is provided to network traffic sources, which adjust their flows based on a per-flow weight (willingness to pay). The load may be determined in-band by routers or out-of-band by an observer node. A load value (e.g., as a price) is increased or decreased based on the actual load or an estimate based on the actual load. The sources obtain the load value and control the output rates per flow based on each flow's associated weight (willingness to pay), e.g., as set by an administrator. Further, two classes of applications are enabled by allowing certain applications to ignore price.
    Type: Application
    Filed: November 8, 2001
    Publication date: May 22, 2003
    Inventors: Paul Barham, Richard Black, Peter Key, Neil Stratford