公开(公告)号：US20080225751A1

公开(公告)日：2008-09-18

申请号：US12040653

申请日：2008-02-29

申请人： Ulas C. Kozat ,  Christine Pepin ,  Haralabos Papadopoulos ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

发明人： Ulas C. Kozat ,  Christine Pepin ,  Haralabos Papadopoulos ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

IPC分类号： H04L12/28

CPC分类号： H04W40/12 ,  H04L12/1881 ,  H04L41/12 ,  H04L41/5003 ,  H04L41/5054 ,  H04L45/14 ,  H04L45/16 ,  H04L45/30 ,  H04L45/38 ,  H04L47/10 ,  H04L47/125 ,  H04L47/15 ,  H04L47/24 ,  H04L47/2408 ,  H04L47/2441 ,  H04L47/38 ,  H04L47/6215

摘要： 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. The method also includes selecting a network code for each virtual graph in the plurality of the virtual graphs to meet requirements of the distinct traffic class corresponding to said each topology graph, where the network code is used to encode packets of the associated traffic class, and processing packets of each traffic class using the network code determined by its corresponding virtual topology and the requirements of said each traffic class, including using a virtual buffer system to implement the network code corresponding to each traffic class over the physical network topology. The method also includes using a scheduler to determine the transmission schedules for each output packet from the virtual buffer system of each traffic class where the scheduling decisions are based, at least in part, on the QoS requirements of each class.

摘要翻译： 本文公开了一种用于通过随时间变化的网络拓扑进行网络编码的信息传递的方法和装置。 在一个实施例中，该方法包括分解将时变网络拓扑建模成多个虚拟图的拓扑图序列，其中多个虚拟图中的每个虚拟图对应于不同的流量类别，虚拟拓扑图 代表时变网络的部分拓扑。 该方法还包括为多个虚拟图中的每个虚拟图选择网络代码以满足对应于所述每个拓扑图的不同流量类别的要求，其中网络代码用于对相关联的流量类别的分组进行编码;以及 使用由其对应的虚拟拓扑确定的网络代码和所述每个流量类别的要求来处理每个流量类别的分组，包括使用虚拟缓冲器系统来实现通过物理网络拓扑对应于每个流量类别的网络代码。 该方法还包括使用调度器至少部分地基于每个类的QoS要求来确定来自调度决策所基于的每个业务类别的虚拟缓冲器系统的每个输出分组的传输调度。

公开(公告)号：US20080089333A1

公开(公告)日：2008-04-17

申请号：US11873248

申请日：2007-10-16

申请人： Ulas C. Kozat ,  Haralabos Papadopoulos ,  Christine Pepin ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

发明人： Ulas C. Kozat ,  Haralabos Papadopoulos ,  Christine Pepin ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

IPC分类号： H04L12/56

CPC分类号： H04L45/123 ,  H04L1/004 ,  H04L1/1607 ,  H04L41/0816 ,  H04L41/083 ,  H04L41/12 ,  H04L41/5022 ,  H04L45/02 ,  H04L45/28 ,  H04L2001/0093

摘要： 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.

摘要翻译： 本文公开了一种用于通过时变网络递送信息的方法和装置。 在一个实施例中，对于多个时间间隔中的每一个，所述方法包括：确定虚拟网络拓扑以在每个时间间隔内使用; 基于虚拟网络拓扑选择时间间隔，在时间间隔期间使用固定网络代码; 以及使用固定网络代码通过时变网络拓扑传输的编码信息，并在每个节点具有必要的虚拟缓冲。

公开(公告)号：US08861356B2

公开(公告)日：2014-10-14

申请号：US12040653

申请日：2008-02-29

申请人： Ulas C. Kozat ,  Christine Pépin ,  Haralabos Papadopoulos ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

发明人： Ulas C. Kozat ,  Christine Pépin ,  Haralabos Papadopoulos ,  Sean A. Ramprashad ,  Carl-Erik W. Sundberg

IPC分类号： H04L12/801 ,  H04L12/851 ,  H04L12/725 ,  H04L12/18 ,  H04W40/12 ,  H04L12/811 ,  H04L12/721 ,  H04L12/761 ,  H04L12/863 ,  H04L12/803 ,  H04L12/24

CPC分类号： H04W40/12 ,  H04L12/1881 ,  H04L41/12 ,  H04L41/5003 ,  H04L41/5054 ,  H04L45/14 ,  H04L45/16 ,  H04L45/30 ,  H04L45/38 ,  H04L47/10 ,  H04L47/125 ,  H04L47/15 ,  H04L47/24 ,  H04L47/2408 ,  H04L47/2441 ,  H04L47/38 ,  H04L47/6215

摘要： 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. The method also includes selecting a network code for each virtual graph in the plurality of the virtual graphs to meet requirements of the distinct traffic class corresponding to said each topology graph, where the network code is used to encode packets of the associated traffic class, and processing packets of each traffic class using the network code determined by its corresponding virtual topology and the requirements of said each traffic class, including using a virtual buffer system to implement the network code corresponding to each traffic class over the physical network topology. The method also includes using a scheduler to determine the transmission schedules for each output packet from the virtual buffer system of each traffic class where the scheduling decisions are based, at least in part, on the QoS requirements of each class.

摘要翻译： 本文公开了一种用于通过随时间变化的网络拓扑进行网络编码的信息传递的方法和装置。 在一个实施例中，该方法包括分解将时变网络拓扑建模成多个虚拟图的拓扑图序列，其中多个虚拟图中的每个虚拟图对应于不同的流量类别，虚拟拓扑图 代表时变网络的部分拓扑。 该方法还包括为多个虚拟图中的每个虚拟图选择网络代码以满足对应于所述每个拓扑图的不同流量类别的要求，其中网络代码用于对相关联的流量类别的分组进行编码;以及 使用由其对应的虚拟拓扑确定的网络代码和所述每个流量类别的要求来处理每个流量类别的分组，包括使用虚拟缓冲器系统来实现通过物理网络拓扑对应于每个流量类别的网络代码。 该方法还包括使用调度器至少部分地基于每个类的QoS要求来确定来自调度决策所基于的每个业务类别的虚拟缓冲器系统的每个输出分组的传输调度。

公开(公告)号：US08089970B2

公开(公告)日：2012-01-03

申请号：US11956141

申请日：2007-12-13

申请人： Sean A. Ramprashad ,  Danjue Li ,  Ulas C. Kozat ,  Christine Pepin

发明人： Sean A. Ramprashad ,  Danjue Li ,  Ulas C. Kozat ,  Christine Pepin

IPC分类号： H04L12/28 ,  H04L12/56 ,  H04J1/10 ,  H04J3/08 ,  H04B7/14 ,  H04W4/00

CPC分类号： H04L41/5019 ,  H04L41/0893 ,  H04L43/0852 ,  H04L67/322 ,  H04W28/16 ,  H04W40/00 ,  H04W84/12

摘要： 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.

摘要翻译： 一种通过多跳网络进行语音传输的方法和系统控制准入。 该方法考虑到多个参数以作出决定并确保系统保持稳定。 参数可以包括选项（例如，聚合级别，突发级别和传输速率）和约束（例如，用户的数量，接入点或每个用户的感测范围）。 该方法计算给定每组选项和约束的网络的负载，并将其与语音编解码器的分组间隔进行比较，以检查系统是否稳定。 该方法的算法在开销降低（例如，由于争用和分组报头）之间找到最佳的权衡，以及如果链路是嘈杂的，对信道错误的鲁棒性的解决方案。 如果存在对应于不同选项的若干稳定解决方案，则可以使用附加标准（例如，最少跳数，最高传输速率）来确定最终的“最佳”解决方案。

公开(公告)号：US20080144497A1

公开(公告)日：2008-06-19

申请号：US11956141

申请日：2007-12-13

申请人： Sean A. Ramprashad ,  Danjue Li ,  Ulas C. Kozat ,  Christine Pepin

发明人： Sean A. Ramprashad ,  Danjue Li ,  Ulas C. Kozat ,  Christine Pepin

IPC分类号： G08C15/00

CPC分类号： H04L41/5019 ,  H04L41/0893 ,  H04L43/0852 ,  H04L67/322 ,  H04W28/16 ,  H04W40/00 ,  H04W84/12

摘要： 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.

摘要翻译： 一种通过多跳网络进行语音传输的方法和系统控制准入。 该方法考虑到多个参数以作出决定并确保系统保持稳定。 参数可以包括选项（例如，聚合级别，突发级别和传输速率）和约束（例如，用户的数量，接入点或每个用户的感测范围）。 该方法计算给定每组选项和约束的网络的负载，并将其与语音编解码器的分组间隔进行比较，以检查系统是否稳定。 该方法的算法在开销降低（例如，由于争用和分组报头）之间找到最佳的权衡，以及如果链路是嘈杂的，对信道错误的鲁棒性的解决方案。 如果存在对应于不同选项的若干稳定解决方案，则可以使用附加标准（例如，最少跳数，最高传输速率）来确定最终的“最佳”解决方案。

公开(公告)号：US08339948B2

公开(公告)日：2012-12-25

申请号：US11531384

申请日：2006-09-13

申请人： Sean A. Ramprashad ,  Christine Pepin ,  Ulas C. Kozat

发明人： Sean A. Ramprashad ,  Christine Pepin ,  Ulas C. Kozat

IPC分类号： H04J3/14

CPC分类号： H04W28/10 ,  H04L47/10 ,  H04L47/14 ,  H04L47/22 ,  H04L47/36

摘要： Wireless access efficiency is improved in a multi-hop, multiple-flow network by optimizing multi-flows over the entire network using joint routing and traffic-shaping techniques at intermediate hops. Even though the joint routing and traffic-shaping techniques may adversely affect flows at some hops, when considered over multiple hops (for a given flow) and over multiple flows (for a given hop or number of hops), significant performance may be achieved for all flows. System performance is achieved by controlling the routing paths of multiple flows in a multi-hop, multi-flow wireless network, and applying traffic shaping in a systematic way, rather than relying on an opportunistic (i.e., randomly or independently optimized) approach.

摘要翻译： 通过使用中间跳的联合路由和流量整形技术在整个网络上优化多流，在多跳，多流网络中提高无线接入效率。 尽管联合路由和流量整形技术可能会对某些跳跃的流量产生不利影响，但在多跳（对于给定的流量）和多个流量（对于给定的跳数或跳数）进行考虑时，可能会实现显着的性能 所有流。 通过控制多跳，多流无线网络中的多个流的路由路径，并以系统的方式应用流量整形，而不是依靠机会主义（即随机或独立优化）方法来实现系统性能。

公开(公告)号：US08396139B2

公开(公告)日：2013-03-12

申请号：US12782649

申请日：2010-05-18

申请人： Ulas C. Kozat

发明人： Ulas C. Kozat

IPC分类号： H04L27/00

CPC分类号： H04L5/003

摘要： 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.

摘要翻译： 本文公开了一种在无线系统中通过未充分利用的信道发送信息的方法和装置。 在一个实施例中，一种在蜂窝系统中使用的方法，其中分配给主用户的信道有时被利用不足，包括：创建唯一的0-1值置换码以在主用户的信道上传送次用户的比特 用户; 基于要为主用户发送的第一组符号和排列代码来创建一个或多个码字; 以及在所述信道上发送所述一个或多个码字。

公开(公告)号：US08316428B2

公开(公告)日：2012-11-20

申请号：US12537760

申请日：2009-08-07

申请人： Ulas C. Kozat ,  Svetlana Radosavac ,  James Kempf

发明人： Ulas C. Kozat ,  Svetlana Radosavac ,  James Kempf

IPC分类号： G06F9/00

CPC分类号： H04L63/14 ,  H04L63/102 ,  H04L67/303 ,  H04L67/34 ,  H04L2463/144

摘要： 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.

摘要翻译： 本文公开了一种用于基于安全风险的准入控制的方法和装置。 在一个实施例中，该方法包括：从用户设备接收访问网络的请求; 基于基于用户设备的安全性评估，基于基于安全的接纳控制策略来接纳用户设备，该策略基于尝试最大化当前接纳的用户设备的和效用的约束优化 如果用户设备被允许进入网络，施加在网络上的已经被接纳的用户设备的风险，其中约束优化基于与将用户设备接纳到网络相关联的实用程序，与用户设备相关联的信誉值，以及 与用户设备相关联的网络上的僵尸网络损坏估计; 并且基于确定是否允许用户设备的结果来将用户设备接纳到网络。

公开(公告)号：US20090055471A1

公开(公告)日：2009-02-26

申请号：US12194157

申请日：2008-08-19

申请人： Ulas C. Kozat ,  Mehmet U. Demircin ,  Oztan Harmanci ,  Sandeep Kanumuri

发明人： Ulas C. Kozat ,  Mehmet U. Demircin ,  Oztan Harmanci ,  Sandeep Kanumuri

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L65/4084 ,  H04L67/1063 ,  H04L67/1076 ,  H04L67/108 ,  H04L67/1091 ,  H04L67/28 ,  H04L67/2852 ,  Y10S707/967

摘要： 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. The control server is operable to send the location information to each peer. In one embodiment, the one control server is also operable to calculate a utility of each caching option and enforce it by sending triggers to the peers to initiate the caching at those peers.

摘要翻译： 本文公开了用于媒体流的系统，方法和装置。 在一个实施例中，系统包括用于服务媒体内容的一个或多个媒体服务器和可通信地耦合到多个对等体中的一个或多个其他对等端的多个对等体以及一个或多个媒体服务器中的至少一个以接收媒体段 内容，其中对等体中的至少一个分配用于服务包括高速缓存存储器的媒体内容的段的资源集合以存储段和媒体文件以及上行链路带宽以将媒体内容的段发送到一个或多个对等体 对等体通讯耦合。 系统还包括跟踪媒体内容需求的第一控制服务器和多个对等体分配的资源，以确定哪个对等体应当缓存媒体文件的哪个段并返回指定一个或多个对等位置的对等位置信息， 对等体是接收每个要求的媒体内容的每个段。 控制服务器可操作地将位置信息发送到每个对等体。 在一个实施例中，一个控制服务器还可操作来计算每个缓存选项的效用，并通过向对等体发送触发器来发起触发器来启动在这些对等体处的缓存。

公开(公告)号：US10332180B2

公开(公告)日：2019-06-25

申请号：US14977154

申请日：2015-12-21

申请人： Ulas C. Kozat ,  Fujio Watanabe ,  Danh Le ,  Erdi Olmezogullari

发明人： Ulas C. Kozat ,  Fujio Watanabe ,  Danh Le ,  Erdi Olmezogullari

IPC分类号： G06Q30/00 ,  G06Q30/06 ,  H04W4/02 ,  H04W4/06

摘要： A method and apparatus for proximity service discovery are disclosed. In one embodiment, the method comprises providing one or more expressions from a market server to at least one wireless broadcasting device for broadcasting over one or more wireless channels, each of the one or more expressions related to different marketplace items, receiving, at the market server, one or more requests from one or more wireless devices for information to identify items being offered in marketplace that match items the one or more wireless devices are attempting to obtain, sending expressions to at least one or more wireless devices associated for matching the relevant broadcast signals associated with items the one or more wireless devices are attempting to obtain, and providing, by the marketing server, data notification channels for direct device-to-device data notification over at least one wireless channel to facilitate information exchange between the at least one wireless broadcasting device and the one or more wireless devices attempting to obtain items being offered by the at least one wireless broadcasting device.