Patents Examined by Christopher P. Grey
  • Patent number: 7986625
    Abstract: Under the present invention, the performance of a set of system resources is monitored in response to incoming request traffic. When a system resource is approaching an overload condition, a corrective action is identified and implemented. Overload thresholds for each system resource and appropriate corrective actions are contained within a management policy. Based on a performance history of the corrective actions, the management policy can be changed/revised.
    Type: Grant
    Filed: December 10, 2002
    Date of Patent: July 26, 2011
    Assignee: International Business Machines Corporation
    Inventors: Jeffrey S. Chase, Ronald P. Doyle, David L. Kaminsky, David M. Ogle, Richard D. Telford
  • Patent number: 7986697
    Abstract: A device and method for processing information fragments, the method includes: receiving multiple information fragments from multiple communication paths; wherein the each information fragment is associated with a cyclic serial number indicating of a generation time of the information fragment; storing the multiple information fragments in multiple input queues, each input queue being associated with a communication path out of the multiple communication paths; determining whether at least one serial number associated with at least one valid information fragment positioned in a head of one of the multiple input queues is located within a pre-rollout serial number range; mapping, in response to the determination, serial numbers associated with each of the valid information fragment positioned in the heads of the multiple input queues to at least one serial number range that differs from the pre-rollout serial number range; and sending to an output queue information fragment metadata associated with a minimal v
    Type: Grant
    Filed: June 13, 2006
    Date of Patent: July 26, 2011
    Assignee: Freescale Semiconductor, Inc.
    Inventors: Boaz Shahar, Liat Kochavi, Noam Sheffer, Michal Shmueli
  • Patent number: 7940789
    Abstract: The invention concerns a method for the rate regulation of radio link probing in a communication network comprising at least a receiver terminal and at least one transmitter terminal, characterized by the steps, at the level of the receiver terminal, of: determining the amount of data sent by each transmitter terminal to the receiver terminal through respective radio links, when a probing of a link is to be made, probing the link corresponding to the transmitter terminal having sent the greatest amount of data.
    Type: Grant
    Filed: January 28, 2003
    Date of Patent: May 10, 2011
    Assignee: Thomson Licensing
    Inventors: Ludovic Jeanne, Patrick Fontaine, Renaud Dore
  • Patent number: 7920554
    Abstract: Middleware may accommodate both packet data and circuit data services in the same cellular telephone. A cellular telephone may travel between networks that are packet and circuit data service based. A protocol middleware may determine whether packet data services are available, and, if so, may determine the mobility management state of the system. Depending on the mobility management state of the system, inappropriate applications may be closed or suspended.
    Type: Grant
    Filed: July 30, 2001
    Date of Patent: April 5, 2011
    Assignee: Intel Corporation
    Inventor: Anil K. Kumar
  • Patent number: 7889679
    Abstract: A system for analyzing a network including a plurality of nodes associated and/or connected together by links. The system includes a processor coupled to a data memory. The processor is configured to access a first representation of the network and associated link weight measures w in the memory. Moreover, the system is configured to provide node values for the nodes and determine from the node values corresponding slope measures for links existing between the nodes, the slope measures being computed from a function of differences in node values and from the weight measures w for the links, the weight measures w being used for scaling the function of differences in nodes values; to select for at least some of the nodes one or more steepest ascent links having one or more greatest positive slope measures; and to generate a second representation corresponding to a steepest ascent graph of the network derived from information included in the steepest ascent links.
    Type: Grant
    Filed: February 2, 2009
    Date of Patent: February 15, 2011
    Assignee: Telenor ASA
    Inventors: Geoffrey Canright, Kenth Engø-Monsen, Johannes Bjelland, Richard Seyler Ling, Pål Roe Sundsøy
  • Patent number: 7876716
    Abstract: A base station (10) performs bi-directional radio communications with terminal station apparatuses using communication frames each having time slots and being composed of a first region with a predetermined open-loop period and a second region with an open-loop period shorter than the open-loop period of the first region. A level detecting section (21) detects a received level of an uplink slot configured in the second region. A transmission diversity section (14) performs diversity transmission on a downlink transmission signal assigned to a downlink slot corresponding to the uplink slot, corresponding to a result of detection of the received level. It is thereby possible to enhance the effect of improving the received quality due to transmission diversity without degrading the transmission efficiency.
    Type: Grant
    Filed: April 16, 2002
    Date of Patent: January 25, 2011
    Assignee: Panasonic Corporation
    Inventor: Hiroaki Sudo
  • Patent number: 7876769
    Abstract: A system manages a buffer having a group of entries. The system receives information relating to a read request for a memory. The system determines whether an entry in the buffer contains valid information. If the entry is determined to contain valid information, the system transmits the information in the entry in an error message. The system may then store the received information in the entry. In another implementation, the system stores data in one of the entries of the buffer, removes an address corresponding to the one entry from an address list, and starts a timer associated with the one entry. The system also determines whether the timer has exceeded a predetermined value, transferring the data from the one entry when the timer has exceeded the predetermined value, and adds the address back to the address list.
    Type: Grant
    Filed: January 18, 2007
    Date of Patent: January 25, 2011
    Assignee: Juniper Networks, Inc.
    Inventors: Anurag P. Gupta, Song Zhang
  • Patent number: 7864758
    Abstract: A storage switch in accordance with an embodiment of the invention is a highly scalable switch that allows the creation of a SAN that is easy to deploy and that can be centrally managed. Moreover, such a storage switch also allows the deployment of a global infrastructure, allowing the resources of the SAN, such as storage devices, to essentially be positioned anywhere on the globe. Further, such a storage switch allows a multi-protocol SAN, e.g., one that includes both iSCSI or Fibre Channel, and processes data packets at “wire speed.” To further enable wire-speed processing, a switch in accordance with the invention has “intelligence” distributed to each of its linecards, through which it classifies packets into data and control packets, it performs virtualization functions, and it performs protocol translation functions. A switch in accordance with the invention further performs serverless storage services such as mirroring, snapshot, and replication.
    Type: Grant
    Filed: January 18, 2002
    Date of Patent: January 4, 2011
    Assignee: EMC Corporation
    Inventors: Santosh C. Lolayekar, Yu-Ping Cheng, Wan-Hui Lee, Renato E. Maranon, Robert T. Frey
  • Patent number: 7839883
    Abstract: The present invention concerns methods and apparatus for implementing a multi-user advance reservation system where reservations are specified in terms of flexible constraints, inflexible constraints and business values. The specification of reservations in this manner allows an entity managing the reservation system to arbitrate among reservations received from a user population with a view toward maximizing business value across the user population. In methods and apparatus of the present invention, penalties and rewards associated with various reservation outcomes can be specified in reservations to assist in business value maximization. In an example, a reservation having a low business value may be declined when there is a significant possibility that a reservation having a high business would be submitted during the pendency of service delivery to the user issuing the reservation with a low business value.
    Type: Grant
    Filed: June 5, 2008
    Date of Patent: November 23, 2010
    Assignee: International Business Machines Corporation
    Inventors: Asit Dan, Robert Filepp, Kavitha Ranganathan, Daniela Rosu
  • Patent number: 7839895
    Abstract: Methods and systems provide approaches to start code emulation prevention at a granularity higher than the bit level. By operating at a level other than the bit level, processing capability requirements on both the encoder and decoder side can be reduced. In accordance with one or more embodiments, a start code emulation prevention method looks for data patterns relative to fixed-size data portions larger than single bits. When a particular pattern is found, start code emulation prevention data is inserted to prevent start code emulation. The inserted data is larger than a single bit and, in some embodiments, comprises a byte. When a decoder decodes data that has had start code emulation prevention data inserted, it can easily identify legitimate start codes and then can remove the start code emulation prevention data to provide the original data that was protected.
    Type: Grant
    Filed: March 6, 2009
    Date of Patent: November 23, 2010
    Assignee: Microsoft Corporation
    Inventors: Gary J. Sullivan, Stephen J. Estrop
  • Patent number: 7830787
    Abstract: A multicast transmission scheme is introduced. A multicast data stream is sent on a default tunnel and switched to a data tunnel during flooding conditions. The default tunnel is a point-to-multipoint tunnel from, for example, a source provider edge router to all other provider edge routers in a virtual private network. The data tunnel is a point-to-multipoint tunnel from, for example, a source provider edge router to other provider edge routers that have recipients. Flooding conditions can occur when sending the multicast data stream on the default tunnel, for example, when a specified bandwidth threshold has been exceeded on a source provider edge router. Additionally, the data tunnel is created by selecting a multicast distribution tunnel group from a configured pool of addresses, advertising the group, receiving data joins from, for example, provider edge routers with recipients, and waiting a specified send time.
    Type: Grant
    Filed: September 25, 2001
    Date of Patent: November 9, 2010
    Assignee: Cisco Technology, Inc.
    Inventors: IJsbrand Wijnands, Arjen Boers, Yiqun Cai, Tony Speakman
  • Patent number: 7817568
    Abstract: Provided are a method for measuring characteristics of a path between nodes by using active testing packets based on priority, i.e., an inter-node path characteristic measuring method, which can measure and provide characteristics of a generated node, when an inter-node data transmission path is generated based on Multi-Protocol Label Switching (MPLS) to provide a path with satisfactory transmission delay, jitter and packet loss that are required by a user, and to provide a computer-readable recording medium for recording a program that implement the method. The method includes the steps of: a) synchronizing system time of the nodes with a global standard time; b) forming each testing packet; c) registering frame sequence and the global standard time during transmission; and d) calculating transmission delay time, jitter and packet loss by using time stamp and packet sequence information of a frame received by the destination node and transmitting the result to the management system.
    Type: Grant
    Filed: May 7, 2004
    Date of Patent: October 19, 2010
    Assignee: Electronics and Telecommunications Research Institute
    Inventors: Euihyun Paik, Tae-Il Kim, Hyeong-Ho Lee
  • Patent number: 7804858
    Abstract: A transmission ECU on a transmission side and reception ECUs on a reception side are connected through communication lines and junction connectors. A delay circuit is provided in each of the junction connectors on the side of the reception ECUs. One end of the delay circuit is connected to the communication line on the side of the transmission ECU and the other end of the same is connected to the communication line on the side of the reception ECU. The communication lines on the both ends of the delay circuit are grounded through termination resistors.
    Type: Grant
    Filed: October 5, 2005
    Date of Patent: September 28, 2010
    Assignee: Yazaki Corporation
    Inventor: Yasuhiro Tamai
  • Patent number: 7801163
    Abstract: A method for allocating space among a plurality of queues in a buffer includes sorting all the queues of the buffer according to size, thereby to establish a sorted order of the queues. At least one group of the queues is selected, consisting of a given number of the queues in accordance with the sorted order. A portion of the space in the buffer is allocated to the group, responsive to the number of the queues in the group. A data packet is accepted into one of the queues in the group responsive to whether the data packet will cause the space occupied in the buffer by the queues in the group to exceed the allocated portion of the space.
    Type: Grant
    Filed: April 13, 2006
    Date of Patent: September 21, 2010
    Inventors: Yishay Mansour, Alexander Kesselman
  • Patent number: 7792054
    Abstract: This invention provides a tool for reliability evaluation and performance analysis of an IP backbone network by using the network packet loss ratio as the main measurement. A queuing model and algorithm is presented for calculating packet loss at congested interfaces or links. A reliability model is presented for considering network hardware component failures such as router failures, ATM switch failures, and physical link failures. Based on the measurement and models presented, a network reliability and performance (NetRAP) apparatus calculates IP network reliability and performance measurements. The NetRAP apparatus uses the network topology, a traffic matrix, and the reliability parameters of a network as inputs and calculates the network packet loss ratio and sigma score, and provides a list of heavily congested links under non-failure or different single failure conditions.
    Type: Grant
    Filed: May 7, 2004
    Date of Patent: September 7, 2010
    Assignee: AT&T Intellectual Property II, L.P.
    Inventors: Leonard L. Lu, David A. Hoeflin, Zhuangbo Tang
  • Patent number: 7792149
    Abstract: A method for formatting a signal in a mobile communication system by appending a plurality of medium access control headers to a plurality of medium access control-service data units for data transfer between a mobile station and network in the mobile communication system. If the service data units have the same characteristics, a medium access control-protocol data unit is formed by successively coupling the service data units to any one of the medium access control headers. If the service data units have different characteristics, the protocol data unit is formed by sequentially coupling each of the service data units and each of the medium access control headers. The formed protocol data unit is then transformed into a transport block with a predetermined size.
    Type: Grant
    Filed: December 8, 2005
    Date of Patent: September 7, 2010
    Assignee: LG Electronics Inc.
    Inventors: In Tae Hwang, Sang Rim Shin, Myoung Jin Ok
  • Patent number: 7782748
    Abstract: A method for determining at least one operational transmit power Snk over a communication channel (Ln) coupled to a disturbance causing transceiver (n) for at least one tone (k), comprises the steps of provision of at least one reference victim communication channel (Lref) for representing at least one reference victim for all victim communication channels which are degraded by cross-talk interferences by said communication channel (Ln), and maximizing the data rate (Rref) over said at least one reference victim communication channel (Lref) under the constraint that the data rate over said communication channel (Ln) achieves a target rate (Rntarget) without exceeding a power constraint (Pnmax).
    Type: Grant
    Filed: December 7, 2005
    Date of Patent: August 24, 2010
    Assignee: Alcatel Lucent
    Inventors: Raphaël Jean Cendrillon, Marc Suzanne Paul Moonen, Tom Bostoen, Peter Luyten, Katleen Peggie Florimond Van Acker, Etienne André Hubert Van Den Bogaert, Jan Sylvia Verlinden, Geert Bert Maarten Ysebaert
  • Patent number: 7751312
    Abstract: The disclosed invention relates to a re-synchronization system that operates in a switching arrangement receiving a plurality of incoming data packets. The switching arrangement is made of an active switch card that transmits the incoming data packets and a backup switch card that may be re-activated by an operator after replacement. The re-synchronization system is implemented in each switch card. When the backup switch card is re-activated, both switch cards receive the incoming data packets and the system of the invention allows to re-synchronized both switch cards by controlling the transmission of the incoming data packets out of each switch card until the same data packets are transmitted. The re-synchronization system further comprise storage for storing the incoming data packets and detector for detecting a re-synchronization information among the incoming data packets.
    Type: Grant
    Filed: June 3, 2004
    Date of Patent: July 6, 2010
    Assignee: International Business Machines Corporation
    Inventors: Alain Benayoun, Patrick Michel, Gilles Toubol
  • Patent number: 7746777
    Abstract: Disclosed is an apparatus and method for granting guaranteed bandwidth between one or more data transmission priority requesting sources and one or more resources upon request. Data sources that do not request an assigned bandwidth are served on a “best efforts” basis. The system allows additional bandwidth to priority requesting sources when it is determined that the resource and/or the communication path to the resource is under-utilized. The system further allows the granted bandwidth to be shared by more than one source in a multiprocessor system.
    Type: Grant
    Filed: September 30, 2003
    Date of Patent: June 29, 2010
    Assignee: International Business Machines Corporation
    Inventors: Jeffrey Douglas Brown, Scott Douglas Clark, John David Irish
  • Patent number: 7738359
    Abstract: A system, device, and method for managing alternate site switching in an optical communication system recovers from failures/degradations that are uncorrected by the core optical communication network. When an uncorrected failure/degradation is detected, communications for a protected end-system are switched from a primary end-system to a backup end-system. The backup end-system may be selected a priori, for example, during connection establishment, in order to reduce switching time once a decision has been made to switch communications from the primary end-system to the backup end-system. Provisions are made for completing the alternate site switching within a specified amount of time. Load balancing may be used to further reduce switching time from the primary end-system to the backup end-system. This alternate site switching augments the various protection mechanisms provided by the core optical communication network in order to provide end-to-end protection for the optical communication path.
    Type: Grant
    Filed: August 15, 2001
    Date of Patent: June 15, 2010
    Assignee: Nortel Networks Limited
    Inventors: Stephen Suryaputra, Indermohan S. Monga, Bruce A. Schofield, Thomas P. Hardjono