Patents by Inventor Sharad Jaiswal

Sharad Jaiswal 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).

  • Publication number: 20120253647
    Abstract: A method and system for increasing accuracy in estimating average time taken to travel through a chosen road segment is provided. The method includes determination of time taken by one or more vehicles to travel through the road segments. Further, correlated road segments for which time taken to travel through the correlated road segments is correlated with the time taken to travel through the chosen road segment, are identified. A data repository stores a list of the one or more correlated road segments. Among the correlated road segments, one or more preferred road segments that increases the accuracy in determining the average time taken to travel through the chosen road segment, is determined by at least one processor. Further, the processor estimates the average time taken to travel through the chosen road segment using, data corresponding to time taken to travel through, the preferred road segments and the chosen road segment.
    Type: Application
    Filed: October 27, 2009
    Publication date: October 4, 2012
    Inventors: Vikram Srinivasan, Avhishek Chatterjee, Samik Datta, Supratim Deb, Sharad Jaiswal
  • Patent number: 8010121
    Abstract: An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bi-partite subgraphs, where k is the number of channels being used for scheduling.
    Type: Grant
    Filed: May 4, 2007
    Date of Patent: August 30, 2011
    Assignee: Alcatel Lucent
    Inventors: Partha Dutta, Sharad Jaiswal, Rajeev Rastogi
  • Patent number: 7636321
    Abstract: A method and computer-program product are provided for measuring the Round-Trip Time (RTT) of data flowing thorough a communications network using a single measurement point. The method includes timestamping a first packet traveling past the measurement point and timestamping a second packet traveling past said measurement point. These difference of these two values is the RTT. This RTT can be continuously updated during the life of the connection to provide an evermore accurate RTT measurement. Alternatively, two sub RTTs can be computed and then summed to arrive at the connection's RTT.
    Type: Grant
    Filed: May 12, 2003
    Date of Patent: December 22, 2009
    Assignee: Sprint Communications Company L.P.
    Inventors: Gianluca Iannaccone, Christophe Diot, Sharad Jaiswal
  • Patent number: 7436778
    Abstract: A method and computer-program product are provided for distinguishing packets sent in successive packet groups. The packet groups are related to each other. The method includes providing an identification point to a connection of a communications network; receiving a sequence number associated with a first packet, which is part of a first group of packets; and receiving a packet-group-length parameter that denotes the number of packets in the first group of packets. Other embodiments are described herein.
    Type: Grant
    Filed: May 12, 2003
    Date of Patent: October 14, 2008
    Assignee: Sprint Communications Company, L.P.
    Inventors: Gianluca Iannaccone, Christophe Diot, Sharad Jaiswal
  • Publication number: 20080159316
    Abstract: An example embodiment includes determining a cut of a graph to obtain a bi-partite sub-graph, where the graph represents a plurality of nodes and links between the plurality of nodes in a wireless mesh network. A channel is assigned to the bi-partite graph, and the obtained bi-partite subgraph is removed from the graph. The determining, assigning and removing steps are repeated until the graph has been divided into k bipartite subgraphs, where k is the number of channels being used for scheduling.
    Type: Application
    Filed: May 4, 2007
    Publication date: July 3, 2008
    Inventors: Partha Dutta, Sharad Jaiswal, Rajeev Rastogi