Patents by Inventor Bhawna Gupta

Bhawna Gupta 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: 7675899
    Abstract: Packet-aware transport architecture and techniques for implementing same that enhance data volume by scaling effectively to rapid data growth are disclosed. For example, a technique for determining a route for a demand in a circuit-switched network comprises the following steps/operations. The demand to be routed in the circuit-switched network is obtained. The circuit-switched networks implements a packet ring (PR) model such that one or more demands are routable on one or more virtual data rings in the circuit-switched network. An Ethernet-Over-SONET (EOS) communication channel in the circuit-switched network suitable for accommodating the demand is specified. The EOS communication channel or one of the one or more virtual data rings is then identified as the new route for the demand.
    Type: Grant
    Filed: November 30, 2005
    Date of Patent: March 9, 2010
    Assignee: Alcatel-Lucent USA Inc.
    Inventors: Swarup Acharya, Bhawna Gupta
  • Publication number: 20090130690
    Abstract: The present invention relates to a novel diagnostic marker useful for the diagnosis of rheumatoid arthritis comprising the autoantibodies of mannose binding lectin protein and a process thereof.
    Type: Application
    Filed: November 14, 2008
    Publication date: May 21, 2009
    Inventors: Hasi Rani Das, Bhawna Gupta, Sunil Kumar Raghav, Kalyan Goswami, Charu Agrawal, Rakha Hari Das
  • Patent number: 7518990
    Abstract: Virtually-concatenated data traffic is routed in a network comprising at least first and second nodes. The first and second nodes may comprise a source-sink node pair, an ingress-egress node pair, or any other pair of network nodes. For a given traffic demand, a plurality of routes for routing the traffic demand through the network are determined. Each of the routes corresponds to a member of a virtually-concatenated group, such that different portions of the traffic demand are assigned to different members of the virtually-concatenated group.
    Type: Grant
    Filed: December 26, 2003
    Date of Patent: April 14, 2009
    Assignee: Alcatel Lucent USA Inc.
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20080313669
    Abstract: Advertisements or other types of targeted information are delivered to a set-top box or other user interface device of signal distribution system. In one aspect of the invention, a detection server of the system detects at least one cue associated with a first media stream, and generates timing information from the detected cue. The timing information is signaled to the interface device. An advertisement server of the system generates a second media stream containing targeted information for delivery to the user interface device. The user interface device switches from the first stream to the second stream based on the timing information. The timing information may also be signaled by the detection server to the advertisement server, for use in controlling generation of the second stream.
    Type: Application
    Filed: June 18, 2007
    Publication date: December 18, 2008
    Inventors: Swarup Acharya, Bhawna Gupta, Anurag Srivastava
  • Publication number: 20080227854
    Abstract: Accordingly the present invention describes the anti-inflammatory compound 3-(1,1-dimethyl-allyl)-6-hydroxy-chromen-2-one isolated from the Ruta graveolens L. plant for the inhibition of inos gene thereby reducing nitric oxide level that increases significantly in inflammatory diseases.
    Type: Application
    Filed: November 6, 2007
    Publication date: September 18, 2008
    Applicant: COUNCIL OF SCIENTIFIC & INDUSTRIAL RESEARCH
    Inventors: Hasi Rani Das, Sunil Kumar Raghav, Bhawna Gupta
  • Patent number: 7426186
    Abstract: A method for data path provisioning in a reconfigurable data network is disclosed. A data path between a source IP router and a destination IP router is determined taking into account the IP-subnets of the network interfaces of the IP routers included in the path. In one embodiment, the requirement that two IP routers can send packets via their connected interface if and only if the two interfaces are on the same subnet (i.e., the subnet constraint) is completely honored during the data path determination. In another embodiment, the data path is determined while allowing some number of violations of the subnet constraint. A transform network graph is computed and is used to determine the data path taking into account the IP-subnets.
    Type: Grant
    Filed: January 16, 2003
    Date of Patent: September 16, 2008
    Assignee: Lucent Technologies Inc.
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Patent number: 7411900
    Abstract: Techniques are disclosed for restoration of virtually-concatenated data traffic in a data transmission network. A virtually-concatenated group is formed comprising: (i) a plurality of primary members each associated with a corresponding data stream, and (ii) at least one backup member. Each of the plurality of primary members and the backup member of the virtually-concatenated group may be assigned a corresponding one of a plurality of data transmission routes between first and second nodes of the network. Responsive to a failure of a given one of the plurality of primary members, the backup member is utilized for restoring at least a portion of the data traffic of the given member. The invention also provides a modified link capacity adjustment scheme (LCAS) protocol which substantially reduces the time required to report changes in member status information from a sink node to a source node, thereby substantially reducing the amount of time required to perform a restoration operation.
    Type: Grant
    Filed: May 28, 2003
    Date of Patent: August 12, 2008
    Assignee: Lucent Technologies Inc.
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Patent number: 7397815
    Abstract: Techniques for defragmenting at least one time division multiplexed link in a communication system, wherein provisioned circuits corresponding to traffic demands are assigned to particular time slots of the link. An optimum layout of free space for the link is computed, subject to an interface rate constraint that may be specified as a minimum cross-connect rate and a maximum cross-connect rate. Particular free slots from the optimum layout of free space are selected, and a hitless migration sequence is determined for migrating one or more of the circuits to one or more of the selected free slots. The time slot assignments of one or more of the circuits are adjusted in accordance with the determined migration, sequence in order to defragment the link.
    Type: Grant
    Filed: January 27, 2005
    Date of Patent: July 8, 2008
    Assignee: Lucent Technologies Inc.
    Inventors: Bhawna Gupta, Pankaj Risbood
  • Patent number: 7317728
    Abstract: A system for and method of, increasing provisionable bandwidth in a multiplexed communication link and a network management system incorporating the system or the method. In one embodiment, the system includes: (1) a defragmentation calculator that calculates a defragmentation of the communication link, the defragmentation containing at least one granularity, (2) a candidate slot selector, associated with the defragmentation calculator, that finds reduced cost candidate slots for the at least one granularity and (3) a circuit mover, associated with the candidate slot selector, that identifies target slots into which circuits occupying the candidate slots can be moved.
    Type: Grant
    Filed: February 25, 2003
    Date of Patent: January 8, 2008
    Assignee: Lucent Technologies Inc.
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20080005770
    Abstract: Methods and apparatus for recording programming content in a signal distribution system are disclosed. In one aspect of the invention, an interrupt is received, which may be associated with an incoming telephone call, email message, alarm or other type of message, and a corresponding interrupt indicator is presented on a user interface screen of a device such as television, laptop computer, mobile telephone, etc. Also presented on the user interface screen of the device is an activatable pause control that if activated initiates recording of a portion of the programming content that would otherwise be presented via the device absent activation of the pause control. Various trick play functions, such as pause, play, forward and rewind, may be provided utilizing the recorded portion of the programming content.
    Type: Application
    Filed: June 30, 2006
    Publication date: January 3, 2008
    Inventors: Swarup Acharya, Bhawna Gupta
  • Publication number: 20070240192
    Abstract: A subscriber or other user is provided with access to a subscription service of a signal distribution system at a location remote from a home location of the user. The subscription service comprises a plurality of selectable channels available to the user at the home location. The user is assigned one of a plurality of program streams utilizable for delivery of content from the head end equipment servicing the remote location to an interface device at the remote location. By way of example, the program streams may be part of existing unicast infrastructure in the head end equipment. The head end equipment obtains content for a first channel of the subscription service available to the user at the home location, and inserts the content for the first channel into the assigned program stream to-thereby make that content accessible to the user at the remote location via the interface device.
    Type: Application
    Filed: April 7, 2006
    Publication date: October 11, 2007
    Inventors: Swarup Acharya, Bhawna Gupta, Anurag Srivastava
  • Publication number: 20070121658
    Abstract: Packet-aware transport architecture and techniques for implementing same that enhance data volume by scaling effectively to rapid data growth are disclosed. For example, a technique for determining a route for a demand in a circuit-switched network comprises the following steps/operations. The demand to be routed in the circuit-switched network is obtained. The circuit-switched networks implements a packet ring (PR) model such that one or more demands are routable on one or more virtual data rings in the circuit-switched network. An Ethernet-Over-SONET (EOS) communication channel in the circuit-switched network suitable for accommodating the demand is specified. The EOS communication channel or one of the one or more virtual data rings is then identified as the new route for the demand.
    Type: Application
    Filed: November 30, 2005
    Publication date: May 31, 2007
    Inventors: Swarup Acharya, Bhawna Gupta
  • Publication number: 20060203745
    Abstract: Techniques are disclosed for generation of spanning trees that support provision of performance-guaranteed services over a circuit-switched network such as, for example, an optical-based network. For example, a technique for generating a spanning tree for use in forwarding Ethernet-based data in a circuit-switched network comprises the following steps/operations. Input information is obtained. The input information comprises a representation of the network, a set of Ethernet-enabled nodes in the network, and a set of demands. A spanning tree is computed based on at least a portion of the input information such that the spanning tree substantially satisfies one or more performance requirements (e.g., one or more bandwidth requirements) associated with the set of demands. Advantageously, in one embodiment, such techniques may provide for generation of spanning trees for use in supporting bandwidth-guaranteed Ethernet services such as E-LAN over a SONET (and SDH) network.
    Type: Application
    Filed: March 11, 2005
    Publication date: September 14, 2006
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood
  • Publication number: 20060165122
    Abstract: Techniques for defragmenting at least one time division multiplexed link in a communication system, wherein provisioned circuits corresponding to traffic demands are assigned to particular time slots of the link. An optimum layout of free space for the link is computed, subject to an interface rate constraint that may be specified as a minimum cross-connect rate and a maximum cross-connect rate. Particular free slots from the optimum layout of free space are selected, and a hitless migration sequence is determined for migrating one or more of the circuits to one or more of the selected free slots. The time slot assignments of one or more of the circuits are adjusted in accordance with the determined migration, sequence in order to defragment the link.
    Type: Application
    Filed: January 27, 2005
    Publication date: July 27, 2006
    Inventors: Bhawna Gupta, Pankaj Risbood
  • Publication number: 20060141547
    Abstract: The present invention relates to a novel diagnostic marker useful for the diagnosis of rheumatoid arthritis comprising the autoantibodies of mannose binding lectin protein and a process thereof.
    Type: Application
    Filed: November 16, 2005
    Publication date: June 29, 2006
    Inventors: Hasi Das, Bhawna Gupta, Sunil Raghav, Kalyan Goswami, Charu Agrawal, Rakha Das
  • Publication number: 20050265251
    Abstract: Link delay is determined in a network comprising a plurality of nodes by identifying pairs of nodes associated with a given link, and, for each of the identified pairs, setting up a virtually-concatenated group (VCG) between the nodes of that pair. The VCGs are utilized to make delay measurements, and the delay measurements are processed to determine delay of the given link. In an illustrative embodiment, the VCGs comprise two-member VCGs with the members being routed on opposite sides of a logical ring. For a given one of these two-member VCGs, a differential delay measurement is made at a particular one of the associated nodes by comparing frame indicator fields for concurrently arriving frames. A system of equations is generated based on the differential delay measurements made utilizing the VCGs, and the system of equations is solved to obtain information utilizable to determine delay of the given link.
    Type: Application
    Filed: May 25, 2004
    Publication date: December 1, 2005
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20050147081
    Abstract: Virtually-concatenated data traffic is routed in a network comprising at least first and second nodes. The first and second nodes may comprise a source-sink node pair, an ingress-egress node pair, or any other pair of network nodes. For a given traffic demand, a plurality of routes for routing the traffic demand through the network are determined. Each of the routes corresponds to a member of a virtually-concatenated group, such that different portions of the traffic demand are assigned to different members of the virtually-concatenated group.
    Type: Application
    Filed: December 26, 2003
    Publication date: July 7, 2005
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20050030901
    Abstract: A system and method for rerouting circuits on a SONET, SDH or similar ring without disrupting service. In one embodiment, the system includes: (1) a route design subsystem adapted to identify, for the circuits, alternative routes that are subject to an alignment constraint and increase an objective value associated with the ring and (2) a path migration subsystem, associated with the route design subsystem, adapted to determine a hitless migration sequence that allows the alternative routes to be employed.
    Type: Application
    Filed: August 8, 2003
    Publication date: February 10, 2005
    Applicant: Lucent Technologies Inc.
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20040252633
    Abstract: Techniques are disclosed for restoration of virtually-concatenated data traffic in a data transmission network. A virtually-concatenated group is formed comprising: (i) a plurality of primary members each associated with a corresponding data stream, and (ii) at least one backup member. Each of the plurality of primary members and the backup member of the virtually-concatenated group may be assigned a corresponding one of a plurality of data transmission routes between first and second nodes of the network. Responsive to a failure of a given one of the plurality of primary members, the backup member is utilized for restoring at least a portion of the data traffic of the given member. The invention also provides a modified link capacity adjustment scheme (LCAS) protocol which substantially reduces the time required to report changes in member status information from a sink node to a source node, thereby substantially reducing the amount of time required to perform a restoration operation.
    Type: Application
    Filed: May 28, 2003
    Publication date: December 16, 2004
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava
  • Publication number: 20040228323
    Abstract: A maximum-flow based route precomputation algorithm includes at least a route generation phase and a route selection phase, and determines one or more routes between at least a given pair of nodes in a network. In the route generation phase, a maximum-flow algorithm is applied to a first set of information characterizing links between the given pair of nodes in the network. The output of the maximum-flow algorithm is utilizable to generate a second set of information characterizing corresponding admissible flows. In the route selection phase, one or more routes are determined based on the second set of information using, for example, a shortest widest path (SWP) algorithm. The route generation and route selection phases may be repeated for each of a plurality of node pairs of the network.
    Type: Application
    Filed: May 15, 2003
    Publication date: November 18, 2004
    Inventors: Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anurag Srivastava