Patents by Inventor Ulas C. Kozat

Ulas C. Kozat 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: 20100323708
    Abstract: A method and apparatus is disclosed herein for sending information over under-utilized channels in wireless systems. In one embodiment, a method for use in a cellular system in which a channel allocated to a primary user is underutilized at times, comprises: creating a unique 0-1 valued permutation code to transmit bits of a secondary user on a channel of the primary user; creating one or more codewords based on a first set of symbols to be transmitted for the primary user and the permutation code; and transmitting the one or more codewords on the channel.
    Type: Application
    Filed: May 18, 2010
    Publication date: December 23, 2010
    Inventor: Ulas C. Kozat
  • Patent number: 7839851
    Abstract: A method, apparatus and system for opportunistic multicasting are described.
    Type: Grant
    Filed: December 17, 2007
    Date of Patent: November 23, 2010
    Assignee: NTT Docomo, Inc.
    Inventor: Ulas C. Kozat
  • Publication number: 20100077470
    Abstract: A method and apparatus is disclosed herein for security risk-based admission control. In one embodiment, the method comprises: receiving a request from the user device to access the network; determining whether to admit the user device based on a security-based admission control policy that admits user devices based on a constraint optimization that attempts to maximize the sum utility of the currently admitted user devices in view of a security assessment of the user device and security risk imposed on the network and already admitted user devices if the user device is admitted to the network, wherein the constraint optimization is based on a utility associated with admitting the user device to the network, a reputation value associated with the user device, and a botnet damage estimation on the network associated with the user device; and admitting the user device to the network based on results of determining whether to admit the user device.
    Type: Application
    Filed: August 7, 2009
    Publication date: March 25, 2010
    Inventors: Ulas C. Kozat, Svetlana Radosavac, James Kempf
  • Publication number: 20100058147
    Abstract: Methods and apparatuses to model the relation between the delay samples and congestion losses and to protect media flows against congestion losses are disclosed. In one embodiment, the method comprises measuring congestion by delay samples, and performing a dynamic FEC algorithm that uses convex hull clustering for loss-event classification, including determining an FEC rate according to the loss-event classification. In another embodiment, the method comprises measuring congestion by delay samples, modeling loss events associated with the delay samples by grouping loss events as unions of convex hulls to identify a period of potentially increased congestion, dynamically changing the FEC rate based on the modeling, and applying FEC protection to the media flow during the period based on the FEC rate.
    Type: Application
    Filed: July 23, 2009
    Publication date: March 4, 2010
    Inventors: Hulya Seferoglu, Ulas C. Kozat, M. Reha Civanlar, James Kempf
  • Publication number: 20090205046
    Abstract: Security attacks on network entities can be compensated for and reduced through insurance that modifies incentives. In one example, a virtual slice provider includes a secure and non-secure slice having resources to provide network access to users through a service provider. The secure slice is assigned a first security level and a non-secure slice is assigned a second lower security level. In one embodiment, the second slice is isolated from the first slice. The virtual slice provider also has a risk policy between the slice provider and the service provider to establish different rates charged to the service provider for access to the secure and non-secure slices and to provide different levels of payment to the service provider for losses resulting from a lack of security in each slice.
    Type: Application
    Filed: November 13, 2008
    Publication date: August 13, 2009
    Applicant: DOCOMO Communications Laboratories USA, Inc.
    Inventors: Svetlana Radosavac, James Kempf, Ulas C. Kozat
  • Publication number: 20090055471
    Abstract: A system, method and apparatus are disclosed herein for media streaming. In one embodiment, the system comprises one or more media servers to serve media content and a plurality of peers communicably coupled to one or more other peers of the plurality of peers and at least one of the one or more media servers to receive segments of media content, where at least one of peers allocates a set of resources for serving the segments of media content including cache memory to store the segments and media files and uplink bandwidth to send the segments of media content to the one or more peers to which the one peer is communicably coupled. The system also includes a first control server to track media content demand and the allocated resources of the plurality of peers to determine which peer should cache which segment of the media file and to return peer location information specifying the one or more peer locations from which each peer is to receive each segment of each media content requested.
    Type: Application
    Filed: August 19, 2008
    Publication date: February 26, 2009
    Inventors: Ulas C. Kozat, Mehmet U. Demircin, Oztan Harmanci, Sandeep Kanumuri
  • Publication number: 20080225751
    Abstract: A method and apparatus is disclosed herein for information delivery with network coding over time-varying network topologies. In one embodiment, the method comprises decomposing a sequence of topology graphs that model a time-varying network topology into a plurality of virtual graphs, where each virtual graph of the plurality of virtual graphs corresponds to a distinct traffic class, and the virtual topology graph representing a partial topology of a time-varying network.
    Type: Application
    Filed: February 29, 2008
    Publication date: September 18, 2008
    Inventors: Ulas C. Kozat, Christine Pepin, Haralabos Papadopoulos, Sean A. Ramprashad, Carl-Erik W. Sundberg
  • Publication number: 20080152061
    Abstract: A method, apparatus and system for opportunistic multicasting are described.
    Type: Application
    Filed: December 17, 2007
    Publication date: June 26, 2008
    Inventor: Ulas C. Kozat
  • Publication number: 20080144497
    Abstract: A method and a system control admission for voice transmission over a multi-hop network. The method takes multiple parameters into account in order to make a decision and ensures that the system remains stable. The parameters may include options (e.g., aggregation level, bursting level, and transmission rate) and constraints (e.g., the number of users, access points, or sensing range of each user). The method computes the load of the network given each set of options and constraints and compares it against the packetization interval of the voice codec to check whether or not the system is stable. An algorithm of the method finds the best trade-offs between overhead reduction (e.g., due to contention and to packet headers) and a solution robust to channel errors, if links are noisy. If several stable solutions corresponding to different options exist, additional criteria (e.g., the least number of hops, the highest transmission rate) may be used to determine the final “best” solution.
    Type: Application
    Filed: December 13, 2007
    Publication date: June 19, 2008
    Inventors: Sean A. Ramprashad, Danjue Li, Ulas C. Kozat, Christine Pepin
  • Publication number: 20080123579
    Abstract: A method and apparatus is disclosed herein for performing multi casting. In one embodiment, the method comprises receiving routing, association, relaying, and/or topology information associated with a plurality of nodes in a multi-hop wireless network, the plurality of nodes communicably coupled in a tree or mesh arrangement via a plurality of broadcast channels; and determining a subset of the plurality of nodes over each broadcast channel on the multi-hop wireless network that is responsible for sending acknowledgment information, in response to receipt or lack of receipt of transmissions, back to senders of transmissions.
    Type: Application
    Filed: November 26, 2007
    Publication date: May 29, 2008
    Inventors: Ulas C. Kozat, Ismail Guvenc
  • Publication number: 20080089333
    Abstract: A method and apparatus is disclosed herein for delivering information over time-varying networks. In one embodiment, the method comprises, for each of a plurality of time intervals, determining a virtual network topology for use over each time interval; selecting for the time interval based on the virtual network topology, a fixed network code for use during the time interval; and coding information to be transmitted over the time-varying network topology using the fixed network code with necessary virtual buffering at each node.
    Type: Application
    Filed: October 16, 2007
    Publication date: April 17, 2008
    Inventors: Ulas C. Kozat, Haralabos Papadopoulos, Christine Pepin, Sean A. Ramprashad, Carl-Erik W. Sundberg