Patents by Inventor Richa Malhotra
Richa Malhotra 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: 9185036Abstract: A method of controlling data flow in a network includes detecting a congestion condition in the network, sending a congestion message to one or more nodes upstream of the congestion condition, learning address information of one or more nodes pertaining to the congestion condition, sending another congestion message containing these learned MAC addresses and, via the nodes receiving the congestion message with the MAC addresses, controlling a flow of data associated with the learned address information from the congestion message. The learned address information may be the MAC address of a destination node to which the data is flowing towards or a MAC address pair of the nodes between which the data is flowing.Type: GrantFiled: March 23, 2005Date of Patent: November 10, 2015Assignee: Alcatel LucentInventor: Richa Malhotra
-
Patent number: 8743693Abstract: The invention includes a method for determining a maximum size of a token bucket. One method includes detecting a condition and determining the maximum token bucket size in response to the condition. The condition may include one of a packet drop and a reduction of a current token bucket size, an actual information rate satisfying a rate threshold, or a current token bucket size satisfying a size threshold. Another method includes detecting a packet drop, detecting a reduction of a current token bucket size, and determining the maximum token bucket size in response to the packet drop and the reduction of the current token bucket size. Another method includes detecting a condition and performing an initial bucket size adaptation in response to the condition where the initial bucket size adaptation has an initial adaptation rate greater than a subsequent adaptation rate associated with a subsequent bucket size adaptation.Type: GrantFiled: September 30, 2005Date of Patent: June 3, 2014Assignee: Alcatel LucentInventors: Richa Malhotra, Ronald Van Haalen
-
Patent number: 8150955Abstract: The present invention enhances the dynamic frequency selection 9DFS) algorithms used in Wireless LANs by adding a channel swapping mechanism. The aim of the traditional DFS algorithm is to dynamically select channels in a wireless LAN in such a way that the best performance is achieved. However, not always the optimal channel selection is achieved. This invention describes an addition to the DFS algorithm in such a way that two APs can decide to swap channels instead of one AP switching to another channel. To avoid the problem of sub-optimal channel selection, a requesting AP sends Swap Requests to other APs in order to sense the willingness of other APs to swap channels with the requesting AP.Type: GrantFiled: November 20, 2008Date of Patent: April 3, 2012Assignee: Agere Systems Inc.Inventors: Patrick Busch, Richa Malhotra
-
Patent number: 8072888Abstract: A method of controlling congestion in a packet switched network includes transmitting a pause message to a node upstream of a congested node to instruct it to cease sending for a period of time. The congested node also sends information to the upstream node informing it of the buffer size required to relieve congestion. If the buffer capacity of the upstream node is greater than or equal to the signalled amount required, no further action is taken. If the buffer capacity of the upstream node is less that the required amount, it in turn sends a pause message to a node upstream of it, together with an indication of the required buffer size to reduce congestion, taking into account the amount available from the sending nodes.Type: GrantFiled: December 3, 2008Date of Patent: December 6, 2011Assignee: Alcatel LucentInventor: Richa Malhotra
-
Patent number: 7701853Abstract: The invention includes a method for determining a window size for a connection. One method according to the invention includes determining a peak information rate for the connection, determining a round trip time for the connection, and determining the window size using the peak information rate and the round trip time. Another method includes determining a token bucket size of a token bucket in response to detecting a condition associated with the token bucket and determining the window size using the token bucket size. Another method includes determining a plurality of connection window sizes for each of a plurality of connections. In this embodiment, the connection window sizes are determined by distributing a total window size across the plurality of connections. A determined window size may be communicated to at least one of a sender of the connection, a receiver of the connection, and a policing module.Type: GrantFiled: September 30, 2005Date of Patent: April 20, 2010Assignee: Alcatel-Lucent USA Inc.Inventors: Richa Malhotra, Ronald Van Haalen
-
Publication number: 20090147685Abstract: A method of controlling congestion in a packet switched network includes transmitting a pause message to a node upstream of a congested node to instruct it to cease sending for a period of time. The congested node also sends information to the upstream node informing it of the buffer size required to relieve congestion. If the buffer capacity of the upstream node is greater than or equal to the signalled amount required, no further action is taken. If the buffer capacity of the upstream node is less that the required amount, it in turn sends a pause message to a node upstream of it, together with an indication of the required buffer size to reduce congestion, taking into account the amount available from the sending nodes.Type: ApplicationFiled: December 3, 2008Publication date: June 11, 2009Inventor: Richa Malhotra
-
Publication number: 20090092101Abstract: The present invention enhances the dynamic frequency selection 9DFS) algorithms used in Wireless LANs by adding a channel swapping mechanism. The aim of the traditional DFS algorithm is to dynamically select channels in a wireless LAN in such a way that the best performance is achieved. However, not always the optimal channel selection is achieved. This invention describes an addition to the DFS algorithm in such a way that two APs can decide to swap channels instead of one AP switching to another channel. To avoid the problem of sub-optimal channel selection, a requesting AP sends Swap Requests to other APs in order to sense the willingness of other APs to swap channels with the requesting AP.Type: ApplicationFiled: November 20, 2008Publication date: April 9, 2009Applicant: AGERE SYSTEMS INC.Inventors: Patrick Busch, Richa Malhotra
-
Patent number: 7499964Abstract: The present invention enhances the dynamic frequency selection 9DFS) algorithms used in Wireless LANs by adding a channel swapping mechanism. The aim of the traditional DFS algorithm is to dynamically select channels in a wireless LAN in such a way that the best performance is achieved. However, not always the optimal channel selection is achieved. This invention describes an addition to the DFS algorithm in such a way that two APs can decide to swap channels instead of one AP switching to another channel. To avoid the problem of sub-optimal channel selection, a requesting AP sends Swap Requests to other APs in order to sense the willingness of other APs to swap channels with the requesting AP.Type: GrantFiled: May 8, 2002Date of Patent: March 3, 2009Assignee: Agere Systems Inc.Inventors: Patrick Busch, Richa Malhotra
-
Publication number: 20070076613Abstract: The invention includes a method for determining a maximum size of a token bucket. One method includes detecting a condition and determining the maximum token bucket size in response to the condition. The condition may include one of a packet drop and a reduction of a current token bucket size, an actual information rate satisfying a rate threshold, or a current token bucket size satisfying a size threshold. Another method includes detecting a packet drop, detecting a reduction of a current token bucket size, and determining the maximum token bucket size in response to the packet drop and the reduction of the current token bucket size. Another method includes detecting a condition and performing an initial bucket size adaptation in response to the condition where the initial bucket size adaptation has an initial adaptation rate greater than a subsequent adaptation rate associated with a subsequent bucket size adaptation.Type: ApplicationFiled: September 30, 2005Publication date: April 5, 2007Inventors: Richa Malhotra, Ronald Haalen
-
Publication number: 20070076621Abstract: The invention includes a method for determining a window size for a connection. One method according to the invention includes determining a peak information rate for the connection, determining a round trip time for the connection, and determining the window size using the peak information rate and the round trip time. Another method includes determining a token bucket size of a token bucket in response to detecting a condition associated with the token bucket and determining the window size using the token bucket size. Another method includes determining a plurality of connection window sizes for each of a plurality of connections. In this embodiment, the connection window sizes are determined by distributing a total window size across the plurality of connections. A determined window size may be communicated to at least one of a sender of the connection, a receiver of the connection, and a policing module.Type: ApplicationFiled: September 30, 2005Publication date: April 5, 2007Inventors: Richa Malhotra, Ronald Van Haalen
-
Publication number: 20060215550Abstract: A method of controlling data flow in a network includes detecting a congestion condition in the network, sending a congestion message to one or more nodes upstream of the congestion condition, learning address information of one or more nodes pertaining to the congestion condition, sending another congestion message containing these learned MAC addresses and, via the nodes receiving the congestion message with the MAC addresses, controlling a flow of data associated with the learned address information from the congestion message. The learned address information may be the MAC address of a destination node to which the data is flowing towards or a MAC address pair of the nodes between which the data is flowing.Type: ApplicationFiled: March 23, 2005Publication date: September 28, 2006Inventor: Richa Malhotra
-
Patent number: 7110374Abstract: The present invention describes an algorithm for the assignment of channels used by access points (APs) in wireless LANs in a dynamic way in order to achieve the best performance. The assignment of channels is based on a procedure in which an AP is passively listening on the other channels during idle time. The AP is calculating the optimal channel with the least interference and sharing. If the AP experiences too much disturbance, it will decide to switch to the calculated optimal channel.Type: GrantFiled: April 16, 2002Date of Patent: September 19, 2006Assignee: Lucent Technologies Inc.Inventors: Richa Malhotra, Patrick Busch
-
Publication number: 20060092833Abstract: When a switch in a switched network detects congestion at one of its inputs, it floods a congestion control message back to the ingress nodes of the network connected to that input, indicating congestion. The ingress nodes of the network restrict access to the network by comparing incoming information rates against customer-specific criteria and sending back pressure warning signals to respective customers when the criteria are exceeded. When an ingress node receives a congestion control message indicating congestion it changes the criteria by which it restricts access to the network to more restrictive criteria. When the switch detects that the congestion has subsided, it floods a further congestion control message to the ingress nodes connected to the input, indicating that the congestion has subsided. An ingress node receiving such a message then changes the criteria back to those which it normally applies.Type: ApplicationFiled: November 2, 2004Publication date: May 4, 2006Inventors: Jeroen Bemmel, Arie Heer, Richa Malhotra
-
Publication number: 20030202463Abstract: A method for establishing a loop-free path for transfer of data packets within a circular network upon a failure within the circular network, wherein the circular network comprises at least three bridges and at least three connections, wherein each connection is between two bridges, wherein each bridge has for each connection an incoming and an outgoing port, characterised in that, the method comprises sending from at least one of the bridges adjacent to a connection which is failing to the other bridges of the circular network an instruction to de-block incoming and outgoing ports which are non-adjacent to the connection which is failing.Type: ApplicationFiled: April 28, 2003Publication date: October 30, 2003Inventors: Arie Johannes de Heer, Richa Malhotra, Ronald de Man, Sandra Roijakkers
-
Publication number: 20030161275Abstract: A method for determining a spanning tree topology, is described. The method includes the steps of detecting a network failure, resolving update of topology, and flushing a MAC table in a network component in response to detecting a network failure, wherein detecting of the network failure comprises receiving an error detection message from the physical layer of the network by the network component. A data communication network component, in particular a bridge, is provided with means for flushing a MAC table or data buffer of the network component in response to detecting a network failure.Type: ApplicationFiled: January 16, 2003Publication date: August 28, 2003Inventors: Richa Malhotra, Nicky van Foreest
-
Publication number: 20020181417Abstract: The present invention describes an algorithm for the assignment of channels used by access points (APs) in wireless LANs in a dynamic way in order to achieve the best performance. The assignment of channels is based on a procedure in which an AP is passively listening on the other channels during idle time. The AP is calculating the optimal channel with the least interference and sharing. If the AP experiences too much disturbance, it will decide to switch to the calculated optimal channel.Type: ApplicationFiled: April 16, 2002Publication date: December 5, 2002Inventors: Richa Malhotra, Patrick Busch
-
Publication number: 20020176437Abstract: The present invention enhances the dynamic frequency selection 9DFS) algorithms used in Wireless LANs by adding a channel swapping mechanism. The aim of the traditional DFS algorithm is to dynamically select channels in a wireless LAN in such a way that the best performance is achieved. However, not always the optimal channel selection is achieved. This invention describes an addition to the DFS algorithm in such a way that two APs can decide to swap channels instead of one AP switching to another channel. To avoid the problem of sub-optimal channel selection, a requesting AP sends Swap Requests to other APs in order to sense the willingness of other APs to swap channels with the requesting AP.Type: ApplicationFiled: May 8, 2002Publication date: November 28, 2002Inventors: Patrick Busch, Richa Malhotra