Patents by Inventor Murat Yuksel
Murat Yuksel 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: 20230006742Abstract: A free-space optical (FSO) transceiver having an optimum number of transmitters and receivers positioned in optimum locations on the transceiver plane to ensure maximum signal-to-interference and noise ratio (SINR) and to minimize the effects of vibration of the mobile platform and atmospheric turbulence. A defocal lens assembly having an adjustable distance between the transmitters and the lens assembly is further provided to maximize the optical coupling efficiency and the vibration tolerance by adjusting the defocusing length.Type: ApplicationFiled: June 23, 2022Publication date: January 5, 2023Inventors: Murat Yuksel, A F M Saniul Haq, Patrick De La Llana
-
Patent number: 10903902Abstract: A mobile visible light communication (VLC) receiver and associated method of use which overcomes the detrimental effects of the time-varying inter-symbol interference (ISI) due to the VLC receiver's high acceptance angle and vibration in the structure utilizing an optimal multiple-symbol detection (MSD) module and a decision feedback affine projection algorithm (DF-APA) module.Type: GrantFiled: October 24, 2019Date of Patent: January 26, 2021Assignee: University of Central Florida Research Foundation, Inc.Inventors: Pooya Nabavi, Murat Yuksel
-
Publication number: 20200136724Abstract: A mobile visible light communication (VLC) receiver and associated method of use which overcomes the detrimental effects of the time-varying inter-symbol interference (ISI) due to the VLC receiver's high acceptance angle and vibration in the structure utilizing an optimal multiple-symbol detection (MSD) module and a decision feedback affine projection algorithm (DF-APA) module.Type: ApplicationFiled: October 24, 2019Publication date: April 30, 2020Inventors: Pooya Nabavi, Murat Yuksel
-
Patent number: 9893385Abstract: Disclosed herein are methods and systems for monitoring and/or regulating energy storage devices. Examples of such monitoring and/or regulating include cell balancing, dynamic impedance control, breach detection and determination of state of charge of energy storage devices.Type: GrantFiled: April 22, 2016Date of Patent: February 13, 2018Assignee: AMBRI INC.Inventors: Hari Nayar, Murat Yuksel
-
Patent number: 9634922Abstract: Among other aspects, the present disclosure provides a computer implemented method of routing information. A first routing information base is received at a proxy router. The first proxy router compares the first routing information based with a second routing information base associated with an assisted router. The proxy router updates the second routing information base based on the first routing information base. The proxy routing transmits updated routing information to the assisted router.Type: GrantFiled: September 11, 2013Date of Patent: April 25, 2017Assignee: BOARD OF REGENTS OF THE NEVADA SYSTEM OF HIGHER EDUCATION, ON BEHALF OF THE UNIVERSITY OF NEVADA, RENOInventors: Murat Yuksel, Tarik Karaoglu
-
Patent number: 9215166Abstract: A method includes receiving, at a first node of a data network, a message indicating a failure of a communication link of the data network. The message is received at the first node from a second node of the data network. The method includes determining an alternate route from the first node to a data source of the data network. The alternate route includes a third node as an upstream node of the first node. The method includes determining whether the third node is a downstream node of the first node prior to sending a first join message from the first node to the third node, and sending the first join message from the first node to the third node conditioned on determining that the third node is not a downstream node of the first node.Type: GrantFiled: April 30, 2013Date of Patent: December 15, 2015Assignee: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Kadangode Ramakrishnan, Robert Doverspike, Murat Yuksel
-
Publication number: 20140075048Abstract: Among other aspects, the present disclosure provides a computer implemented method of routing information. A first routing information base is received at a proxy router. The first proxy router compares the first routing information based with a second routing information base associated with an assisted router. The proxy router updates the second routing information base based on the first routing information base. The proxy routing transmits updated routing information to the assisted router.Type: ApplicationFiled: September 11, 2013Publication date: March 13, 2014Applicant: Board of Regents of the Nevada System of Higher Education, on behalf of the University of Nevada,Inventors: Murat Yuksel, Tarik Karaoglu
-
Publication number: 20130235717Abstract: A method includes receiving, at a first node of a data network, a message indicating a failure of a communication link of the data network. The message is received at the first node from a second node of the data network. The method includes determining an alternate route from the first node to a data source of the data network. The alternate route includes a third node as an upstream node of the first node. The method includes determining whether the third node is a downstream node of the first node prior to sending a first join message from the first node to the third node, and sending the first join message from the first node to the third node conditioned on determining that the third node is not a downstream node of the first node.Type: ApplicationFiled: April 30, 2013Publication date: September 12, 2013Applicant: AT&T Intellectual Property I, L.P.Inventors: Kadangode Ramakrishnan, Robert Doverspike, Murat Yuksel
-
Patent number: 8462621Abstract: Systems and methods of multicast configuration are provided. A particular method includes detecting a failure in the data network at a first node of a data network. The method also includes determining an alternate route from the first node to a data source of the data network. The alternate route includes a second node as an upstream node. The method further includes determining whether the alternate route would create a loop in the data network. The method includes setting a state of the first node to a waiting-to-join the second node state when the alternate route would create a loop.Type: GrantFiled: July 27, 2009Date of Patent: June 11, 2013Assignee: AT&T Intellectual Property I, L.P.Inventors: Kadangode Ramakrishnan, Robert Doverspike, Murat Yuksel
-
Publication number: 20110019534Abstract: Systems and methods of multicast configuration are provided. A particular method includes detecting a failure in the data network at a first node of a data network. The method also includes determining an alternate route from the first node to a data source of the data network. The alternate route includes a second node as an upstream node. The method further includes determining whether the alternate route would create a loop in the data network. The method includes setting a state of the first node to a waiting-to-join the second node state when the alternate route would create a loop.Type: ApplicationFiled: July 27, 2009Publication date: January 27, 2011Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Kadangode Ramakrishnan, Robert Doverspike, Murat Yuksel
-
Patent number: 7200117Abstract: A system for selecting routing information from a routing table describing alternative routes between end nodes. The routing table represents a set of minimum cost, deadlock-free routes between end nodes. The selected routing information is included in forwarding tables, and sent to networking devices in the network. The selected routing information is optimized for at least one network performance metric, such as overall network capacity or fault tolerance. Capacity optimization is obtained by selecting from alternative routes stored within the routing table such that the standard deviation of the number of routes flowing over each link in the network is minimized. Fault tolerance optimization is achieved by selecting from the alternative routes stored in the routing table such that the selected route for a given end node pair has a “failover” route with a maximum number of dissimilar links from the selected route.Type: GrantFiled: January 31, 2002Date of Patent: April 3, 2007Assignee: Sun Microsystems, Inc.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Patent number: 7152113Abstract: A system and method for adding routing information for a node to a routing table, which efficiently makes necessary changes to the routing table to support routing to and from the node, while maintaining the deadlock-free quality of the paths described by the routing table. The routing table is generated by storing routing information in the routing table that reflects and describes a deadlock-free set of paths through a network of nodes. A row of entries is added to the routing table describing how to forward data units from the node. A column of entries is added to the routing table describing how to forward data units addressed to the node. The forwarding information within each entry added to the routing table maintains the deadlock-free quality of the set of paths represented by the forwarding table.Type: GrantFiled: October 19, 2001Date of Patent: December 19, 2006Assignee: Sun Microsystems, Inc.Inventors: John V. Reynders, Radia J. Perlman, Guy L. Steele, Jr., Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Patent number: 7096251Abstract: A distributed system and method generate “layered routes” that reflect a layered representation of a network, which representation provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination. A device that determines a better or equal cost path to a destination node with respect to its current path to that node sends a route information message to its neighbor devices. The receiver of a route information message may then accept the message and begin using the new path described by the message, or reject the message without using the new path.Type: GrantFiled: July 31, 2002Date of Patent: August 22, 2006Assignee: Sun Microsystems, Inc.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Radia J. Perlman, Murat Yuksel
-
Publication number: 20030172180Abstract: A system and method for adding routing information for a node to a routing table, which efficiently makes necessary changes to the routing table to support routing to and from the node, while maintaining the deadlock-free quality of the paths described by the routing table. The routing table is generated by storing routing information in the routing table that reflects and describes a deadlock-free set of paths through a network of nodes. A row of entries is added to the routing table describing how to forward data units from the node. A column of entries is added to the routing table describing how to forward data units addressed to the node. The forwarding information within each entry added to the routing table maintains the deadlock-free quality of the set of paths represented by the forwarding table.Type: ApplicationFiled: October 19, 2001Publication date: September 11, 2003Applicant: Sun Microsystems, Inc.Inventors: John V. Reynders, Radia J. Perlman, Guy L. Steele, Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Publication number: 20030142627Abstract: A system for selecting routing information from a routing table describing alternative routes between end nodes. The routing table represents a set of minimum cost, deadlock-free routes between end nodes. The selected routing information is included in forwarding tables, and sent to networking devices in the network. The selected routing information is optimized for at least one network performance metric, such as overall network capacity or fault tolerance. Capacity optimization is obtained by selecting from alternative routes stored within the routing table such that the standard deviation of the number of routes flowing over each link in the network is minimized. Fault tolerance optimization is achieved by selecting from the alternative routes stored in the routing table such that the selected route for a given end node pair has a “failover” route with a maximum number of dissimilar links from the selected route.Type: ApplicationFiled: January 31, 2002Publication date: July 31, 2003Applicant: Sun Microsystems, Inc.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Murat Yuksel
-
Publication number: 20030140165Abstract: A distributed system and method for generating “layered routes.” The layered routes generated by the disclosed system reflect a layered representation of the network. By operating in accord with the layered representation of the network, the disclosed system provides deadlock-free routes. The layered representation consists of an ordered set of layers, where each layer is a deadlock-free sub-topology of the network. In determining routes using links from different layers, the links used in each route are constrained to be taken from layers of non-decreasing order as the route extends from source to destination.Type: ApplicationFiled: July 31, 2002Publication date: July 24, 2003Applicant: SUN MICROSYSTEMS, INC.Inventors: Dah Ming Chiu, Miriam C. Kadansky, Radia J. Perlman, Murat Yuksel