Patents Examined by Puneet Bhandari
  • Patent number: 7200111
    Abstract: A protocol for differentiating congestion-related packet loss versus random packet loss in a wireless data connection. The protocol monitors changes in the length of a transmission queue in a wireless data connection over an interval substantially equal to the amount of time it takes to transmit a window of data packets and receive acknowledgements corresponding to all data packets transmitted in the window. If packet loss is preceded by an increase in the queue length over two consecutive intervals, the packet loss is designated as being due to congestion and a congestion avoidance algorithm is initiated. Otherwise, the packet loss is designated as random loss and the transmission window is maintained at its current size. The protocol reduces the transmission rate only when congestion is identified as the cause of lost packets; otherwise wireless losses can simply be quickly retransmitted without a reduction in the data transmission rate.
    Type: Grant
    Filed: August 30, 2001
    Date of Patent: April 3, 2007
    Assignee: The Regents of the University of California
    Inventors: Jose Joaquin Garcia-Luna-Aceves, Christina Parsa
  • Patent number: 7123585
    Abstract: Each sink port in a cross-bar switch provides for allocating bandwidth among data packets. Packets are assigned priority levels, and the cross-bar switch regulates bandwidth allocation for each priority level. A sink port records traffic volume for packet data of each priority level. The sink port calculates a weighted average bandwidth for each different priority level and determines whether to reject packet data for the priority level. When the packet data collected by a sink port exceeds a threshold, the sink port rejects data packets with priority levels having excessive weighted average bandwidths.
    Type: Grant
    Filed: December 21, 2001
    Date of Patent: October 17, 2006
    Assignee: Juniper Networks, Inc.
    Inventors: Abbas Rashid, Nazar Zaidi, Mark Bryers, Fred Gruner
  • Patent number: 7079544
    Abstract: In a device that interworks a VLAN network and an MPLS network, a VLAN ID is associated with an MPLS label. In a device that performs interworking from a VLAN network to an MPLS network, an output MPLS label is determined from a pair of a VLAN ID and the information in the layer 3 or layer 4 header of a packet. The output MPLS label is assigned an independent value for each VLAN. In a device that performs interworking from the MPLS network to another VLAN network, the input MPLS label is associated with a VLAN ID.
    Type: Grant
    Filed: February 12, 2001
    Date of Patent: July 18, 2006
    Assignee: Hitachi, Ltd.
    Inventors: Koji Wakayama, Kenichi Sakamoto, Takeshi Aimoto, Takahisa Miyamoto
  • Patent number: 7020083
    Abstract: A protocol for differentiating congestion-related packet loss versus random packet loss in a wireless data connection. The protocol monitors changes in the length of a transmission queue in a wireless data connection over an interval substantially equal to the amount of time it takes to transmit a window of data packets and receive acknowledgements corresponding to all data packets transmitted in the window. If packet loss is preceded by an increase in the queue length over two consecutive intervals, the packet loss is designated as being due to congestion and a congestion avoidance algorithm is initiated. Otherwise, the packet loss is designated as random loss and the transmission window is maintained at its current size. The protocol reduces the transmission rate only when congestion is identified as the cause of lost packets; otherwise wireless losses can simply be quickly retransmitted without a reduction in the data transmission rate.
    Type: Grant
    Filed: October 29, 2001
    Date of Patent: March 28, 2006
    Assignee: The Regents of the University of California
    Inventors: Jose Joaquin Garcia-Luna-Aceves, Christina Parsa
  • Patent number: 7006437
    Abstract: Scheduling mechanisms for attaining a per-hop behavior for a plurality of classes of packet traffic in a multi-hop network are described. The per-hop behavior allocates to each class a nominal departure rate and a minimum percentage of available bandwidth. The scheduling mechanisms define a first condition that affects packet forwarding in accordance with the nominal departure rates allocated to the classes and a second condition that affects packet forwarding in accordance with the minimum percentages of the available bandwidth allocated to the classes. Packet forwarding rates for each of the classes are compared with the first and second conditions to select one of the classes for forwarding packets of that class over the network.
    Type: Grant
    Filed: July 6, 2001
    Date of Patent: February 28, 2006
    Assignee: SRI International
    Inventors: Richard G. Ogier, Ambatipudi R. Sastry
  • Patent number: 6999406
    Abstract: A reception synchronization apparatus capable of achieving precise synchronization of an OFDM signal including a frame guard added to the OFDM signal includes a multiplier for calculating the correlation between a received OFDM signal and an OFDM signal delayed by a delay circuit; a moving integration circuit for adding a signal from the multiplier over a guard period; n frame guard removing circuits, which respectively receive a signal from the moving integration circuit, remove the frame guard period from the received signal, and output a resultant signal; n interval integrators for cumulatively adding signals outputted from the frame guard removing circuits; and a detection circuit for detecting a maximum peak from the results from the n interval integrators and generating a detection signal indicating a synchronization timing position corresponding to the detected maximum peak position.
    Type: Grant
    Filed: December 5, 2001
    Date of Patent: February 14, 2006
    Assignee: Sony Corporation
    Inventors: Hiroaki Takahashi, Mitsuhiro Suzuki
  • Patent number: 6996065
    Abstract: A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary/active path and a secondary/backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.
    Type: Grant
    Filed: July 5, 2001
    Date of Patent: February 7, 2006
    Assignee: Lucent Technologies Inc.
    Inventors: Muralidharan S. Kodialam, Tirunell V. Lakshman
  • Patent number: 6967935
    Abstract: A method for performing communication between a base station and a mobile station through a designated channel is disclosed.
    Type: Grant
    Filed: August 17, 2000
    Date of Patent: November 22, 2005
    Assignee: Samsung Electronics Co., Ltd.
    Inventors: Jin-Soo Park, Hi-Chan Moon, Jae-Min Ahn
  • Patent number: 6965589
    Abstract: The invention is a method for limiting the peak transmit power in a CDMA communication system including the steps transmitting a first communication signal having a first high transmit power region and transmitting a second communication signal having a second high transmit power region. One of the first and second communication signals is time offset to prevent the first and second high transmit power regions from occurring simultaneously. Time shifting only a portion of one of the first and second communications signals is also taught. The first and second communication signals can also include respective first and second low transmit power regions. The time offset can be selected to align one of the first and second high transmit power regions with one of the first and second low transmit power regions.
    Type: Grant
    Filed: February 25, 2002
    Date of Patent: November 15, 2005
    Assignee: QUALCOMM, Incorporated
    Inventors: Stein A. Lundby, Edward G. Tiedemann, Jr., Jack M. Holtzman, Daisuke Terasawa
  • Patent number: 6898202
    Abstract: A method, apparatus, and computer program device enabling a computer network switching device to inform an attached requesting device of switch ports affected by configuration changes during the period of time since the last query by the particular requesting device. The switch device is initialized with a change index and data vector, the latter indicative of an initial port configuration. The switch increments the index in response to subsequent port configuration change events, and stores in association with the incremented index a data vector indicating the ports changed during the corresponding event. The switch stores an array of associated index and vector values. The switch responds to a query from an attached requesting device by informing the requesting device of specific ports affected by one or more configuration changes since the index value held by the requesting device was the current index value in the switch.
    Type: Grant
    Filed: June 27, 2001
    Date of Patent: May 24, 2005
    Assignee: International Business Machines Corporation
    Inventors: Robert J. Gallagher, William J. Rooney
  • Patent number: 6859449
    Abstract: In a first aspect this invention discloses methods and apparatus for operating a radio link protocol receiver when receiving data blocks from a transmitter. The method includes receiving a data block and making a determination as to whether the size of a receive window is less than or equal to a bitmap size, where the bitmap size is the maximum size, in bits, of the bitmap to be reported in an acknowledgment message. If the determination is positive, then the reported bitmap covers the entire receive window, while if the determination is negative the reported bitmap covers only the beginning of the receive window and covers as many blocks as there are bits in the reported bitmap.
    Type: Grant
    Filed: May 19, 2003
    Date of Patent: February 22, 2005
    Assignee: Nokia Corporation
    Inventors: Petri Grönberg, Guillaume Sèbire