Patents by Inventor Sunil Samtani
Sunil Samtani 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: 11811661Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: GrantFiled: November 27, 2018Date of Patent: November 7, 2023Assignee: Nytell Software LLCInventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Publication number: 20190273684Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: ApplicationFiled: November 27, 2018Publication date: September 5, 2019Inventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Patent number: 10178028Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: GrantFiled: August 10, 2016Date of Patent: January 8, 2019Assignee: Nytell Software LLCInventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Publication number: 20170155588Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: ApplicationFiled: August 10, 2016Publication date: June 1, 2017Inventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Patent number: 9438516Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: GrantFiled: May 10, 2011Date of Patent: September 6, 2016Assignee: Nytell Software LLCInventors: Kirk K. Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Publication number: 20110211480Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: ApplicationFiled: May 10, 2011Publication date: September 1, 2011Applicant: TELCORDIA LICENSING COMPANY, LLCInventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Patent number: 7965644Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.Type: GrantFiled: May 18, 2010Date of Patent: June 21, 2011Inventors: Kirk K. Chang, John M. Sucec, Harshad Tanna, John Lee, Sunil Samtani
-
Patent number: 7957276Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: GrantFiled: April 28, 2005Date of Patent: June 7, 2011Assignee: Telcordia Licensing Company, LLCInventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Publication number: 20100220629Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.Type: ApplicationFiled: May 18, 2010Publication date: September 2, 2010Inventors: Kirk K. Chang, John M. Sucec, Harshad Tanna, John Lee, Sunil Samtani
-
Patent number: 7768933Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.Type: GrantFiled: October 14, 2005Date of Patent: August 3, 2010Inventors: Kirk K. Chang, John M. Sucec, Harshad Tanna, John Lee, Sunil Samtani
-
Publication number: 20100011118Abstract: In a secure network where the network characteristics are not known, a call admission control algorithm and a preemption control algorithm based on a destination node informing the source node of the observed carried traffic are used to regulate the amount of traffic that needs to be preempted by the source. The amount of traffic that needs to be preempted is based on the carried traffic measured at the destination node. The traffic to be preempted is based on the priority of the traffic, where the lowest priority traffic is the first to be preempted until the amount of traffic preempted is sufficient to allow the remaining traffic to pass through the network without congestion.Type: ApplicationFiled: April 28, 2005Publication date: January 14, 2010Inventors: Kirk Chang, Gi Tae Kim, John Unger, John Sucec, Sunil Samtani
-
Patent number: 7359322Abstract: Bandwidth allocated between the traffic classes of a network path is dynamically reallocated when one or more traffic classes have insufficient available bandwidth to support a service request for the traffic classes, wherein the reallocation occurs without modifying the traffic class bandwidth allocations enforced by router mechanisms. A provisioning system maintains an available bandwidth indication for each traffic class, which indications are decremented as a service request is admitted to the path. If a requested traffic class has insufficient available bandwidth to support a request, one or more other traffic classes can loan bandwidth to the requested traffic class by decrementing the available bandwidth indicators for the one or more other traffic classes in the amount of the insufficiency, thereby indicating that less bandwidth is available in these classes for future requests.Type: GrantFiled: August 12, 2002Date of Patent: April 15, 2008Assignee: Telcordia Technologies, Inc.Inventors: Sumit Khurana, Sunil Samtani, Rajesh Talpade
-
Publication number: 20070242616Abstract: Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. “Fast packets”, i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects.Type: ApplicationFiled: October 14, 2005Publication date: October 18, 2007Inventors: Kirk Chang, John Sucec, Harshad Tanna, John Lee, Sunil Samtani
-
Patent number: 6862291Abstract: Methods and systems are provided for provisioning a network by identifying the classes of traffic to be transported in the network as well as the QoS criteria of the identified classes of traffic. By simulating the classes of traffic, one or more QoS mechanisms and their associated parameters may be determined. The statistical multiplexing gains of the classes of traffic may also be determined based on the simulation. Then, one or more resources in the network may be allocated based on the QoS mechanisms and parameters as well as the multiplexing gains.Type: GrantFiled: April 9, 2001Date of Patent: March 1, 2005Assignee: Telcordia Technologies, Inc.Inventors: Rajesh Rasik Talpade, Gi Tae Kim, Sunil Samtani, Larry H. Wong, Petros Mouchtaris
-
Publication number: 20040028054Abstract: Bandwidth allocated between the traffic classes of a network path is dynamically reallocated when one or more traffic classes have insufficient available bandwidth to support a service request for the traffic classes, wherein the reallocation occurs without modifying the traffic class bandwidth allocations enforced by router mechanisms. A provisioning system maintains an available bandwidth indication for each traffic class, which indications are decremented as a service request is admitted to the path. If a requested traffic class has insufficient available bandwidth to support a request, one or more other traffic classes can loan bandwidth to the requested traffic class by decrementing the available bandwidth indicators for the one or more other traffic classes in the amount of the insufficiency, thereby indicating that less bandwidth is available in these classes for future requests.Type: ApplicationFiled: August 12, 2002Publication date: February 12, 2004Inventors: Sumit Khurana, Sunil Samtani, Rajesh Talpade
-
Publication number: 20020145982Abstract: Methods and systems are provided for provisioning a network by identifying the classes of traffic to be transported in the network as well as the QoS criteria of the identified classes of traffic. By simulating the classes of traffic, one or more QoS mechanisms and their associated parameters may be determined. The statistical multiplexing gains of the classes of traffic may also be determined based on the simulation. Then, one or more resources in the network may be allocated based on the QoS mechanisms and parameters as well as the multiplexing gains.Type: ApplicationFiled: April 9, 2001Publication date: October 10, 2002Inventors: Rajesh Rasik Talpade, Gi Tae Kim, Sunil Samtani, Larry H. Wong, Petros Mouchtaris