公开(公告)号：US06975591B1

公开(公告)日：2005-12-13

申请号：US09718679

申请日：2000-11-22

申请人： Rajeev Shorey ,  Abhay Chrungoo ,  Vishu Gupta ,  Huzur Saran

发明人： Rajeev Shorey ,  Abhay Chrungoo ,  Vishu Gupta ,  Huzur Saran

IPC分类号： H04L12/24 ,  H04L29/06 ,  G01R31/08

CPC分类号： H04L43/0829 ,  H04L1/0002 ,  H04L1/187 ,  H04L41/5025 ,  H04L69/16 ,  H04L69/163 ,  H04W80/06

摘要： A method for improving TCP throughput over lossy communication links without affecting performance over non-lossy links comprises determining lookahead-loss which is the number of lost packets in a given loss-window; using the loss-window and lookahead-loss to detect congestion in the communication links; and controlling transmission under congestion conditions and under normal conditions, wherein the controlling transmission comprises controlling a size of the loss-window by beginning in a slow-start phase; advancing to a congestion avoidance phase when a slow-start threshold is reached; entering a halt growth phase when the first level of packet loss has been recovered; returning to the congestion avoidance phase when a first level of packet recovery occurs; entering a k-recovery phase when a second level of packet loss occurs. The loss window and slow-start threshold are reduced in half and returned to the congestion avoidance phase when the second level of packet loss has been recovered.

摘要翻译： 一种用于通过有损通信链路改善TCP吞吐量而不影响非有损链路的性能的方法包括确定在给定的丢失窗口中丢失分组数量的前瞻丢失; 使用丢失窗口和前瞻性丢失来检测通信链路中的拥塞; 以及在拥塞状况和正常条件下控制传输，其中所述控制传输包括通过从慢启动阶段开始来控制所述损失窗口的大小; 当达到慢启动阈值时，进入拥塞避免阶段; 当第一级数据包丢失已经恢复时进入停止增长阶段; 当发生第一级数据包恢复时返回到拥塞避免阶段; 当发生第二级丢包时进入k恢复阶段。 丢失窗口和慢启动阈值减少一半，并在第二级丢包恢复后返回到拥塞避免阶段。

公开(公告)号：US06807159B1

公开(公告)日：2004-10-19

申请号：US09696556

申请日：2000-10-25

申请人： Rajeev Shorey ,  Apurva Kumar ,  Indraneel Chakraborty ,  Abhishek Kashyap ,  Anupam Rastogi ,  Huzur Saran

发明人： Rajeev Shorey ,  Apurva Kumar ,  Indraneel Chakraborty ,  Abhishek Kashyap ,  Anupam Rastogi ,  Huzur Saran

IPC分类号： H04B7185

CPC分类号： H04W74/06 ,  H04L12/12 ,  H04W52/0212 ,  H04W52/0235 ,  Y02D70/144

摘要： A system, method, and computer program product for carrying out the method for managing power consumption in a master driven time division duplex wireless network comprising optimizing power consumption while maintaining quality of service requirements for end-to-end packet delay by adjusting the polling interval for each slave in low power mode based on the incoming traffic at the slave.

摘要翻译： 一种用于执行主驱动时分双工无线网络中的功耗管理方法的系统，方法和计算机程序产品，包括优化功耗，同时通过调整轮询间隔来维持端到端分组延迟的服务质量要求 基于来自从站的进入流量，对于每个从属设备，在低功耗模式下。

公开(公告)号：US06963534B1

公开(公告)日：2005-11-08

申请号：US09680168

申请日：2000-10-05

申请人： Rajeev Shorey ,  Ashu Razdan ,  Abhishek Das ,  Abhishek Ghose ,  Huzur Saran

发明人： Rajeev Shorey ,  Ashu Razdan ,  Abhishek Das ,  Abhishek Ghose ,  Huzur Saran

IPC分类号： H04J3/16 ,  H04J3/24 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04W28/06 ,  H04W28/14 ,  H04W74/00 ,  H04W74/04

摘要： The present invention relates to a computer implemented system for transferring data over a master driven TDD/TDMA based wireless network operating with minimum delay in end-to-end transmission by achieving optimum time slot utilization by minimizing the number of baseband packets created for each Link layer packet, where each baseband packet of is a size corresponding to one of a permitted set of capacities ‘C1, C2, . . . Cn’. The system also optimizes sharing of bandwidth, higher link utilization and low baseband packet transmission queue occupancy by adaptive scheduling of the transmission of the baseband packets in the queues. The invention also provides a method and computer program product for the above system.

摘要翻译： 本发明涉及一种计算机实现的系统，用于通过在端对端传输中以最小延迟操作的主驱动TDD / TDMA无线网络上传送数据，通过最小化为每个链路创建的基带分组数量来实现最佳时隙利用 层分组，其中每个基带分组的大小对应于允许的容量集合C 1，C 2 2之一。 。 。 Cn'。 该系统通过队列中基带分组传输的自适应调度，优化了带宽共享，链路利用率较高，低基带分组传输队列占用率。 本发明还提供了一种用于上述系统的方法和计算机程序产品。

公开(公告)号：US06829649B1

公开(公告)日：2004-12-07

申请号：US09710163

申请日：2000-11-10

申请人： Rajev Shorey ,  Huzur Saran ,  Abhinav Kamra ,  Sundeep Kapila ,  Varun Khurana ,  Vikas Yadav

发明人： Rajev Shorey ,  Huzur Saran ,  Abhinav Kamra ,  Sundeep Kapila ,  Varun Khurana ,  Vikas Yadav

IPC分类号： G06F1516

CPC分类号： H04L47/32 ,  H04L47/10 ,  H04L47/215 ,  H04L47/30 ,  H04L47/50 ,  H04L47/527

摘要： A method, a system and a computer program product are disclosed for allocating bandwidth of a limited bandwidth link to dataflows containing packets. In the method, the number of buckets is adaptively adjusted dependent upon the number of active dataflows. Each bucket has a number of tokens allocated to the bucket for use by the corresponding dataflow. The number of tokens is dependent upon a weighted value for the corresponding dataflow. Queueing of the packets for utilization of the limited bandwidth link is dependent upon the tokens. Tokens are then adaptively-reallocated to one or more buckets in accordance with a weighted value for each of the dataflows.

摘要翻译： 公开了一种用于将有限带宽链路的带宽分配给包含分组的数据流的方法，系统和计算机程序产品。 在该方法中，桶的数量根据活动数据流的数量自适应地调整。 每个桶具有分配给桶的许多令牌以供相应的数据流使用。 令牌的数量取决于相应数据流的加权值。 用于有限带宽链路利用的数据包的排队取决于令牌。 然后根据每个数据流的加权值将令牌自适应地重新分配到一个或多个存储桶。

公开(公告)号：US07065051B2

公开(公告)日：2006-06-20

申请号：US09819947

申请日：2001-03-27

申请人： Manish Airy ,  Partho Mishra ,  Huzur Saran

发明人： Manish Airy ,  Partho Mishra ,  Huzur Saran

IPC分类号： G01R31/08

CPC分类号： H04W72/1252 ,  H04L5/0007 ,  H04L5/0023 ,  H04L5/0037 ,  H04L5/14 ,  H04L47/6255 ,  H04L47/6265 ,  H04W28/14 ,  H04W72/1284

摘要： The invention includes an apparatus and method for wirelessly transmitting data between a plurality of subscriber units and a base transceiver station. The method includes at least one subscriber unit transmitting a request to send data blocks to the base transceiver station. The request includes a data transmission queue size value. A base user queue size estimate is updated at the base transceiver station. The base user queue size estimate corresponds to the one subscriber unit that transmitted the request to send data. The base user queue size estimate is based upon the data transmission queue size value. The base transceiver station generates a schedule that includes time slots and frequency blocks in which the requested data blocks are to be transmitted from the one subscriber unit to the base transceiver station. The subscriber unit transmits the data blocks the subscriber requested to be sent, according to the schedule. Each transmitted data block includes encoded information representing a current data transmission queue size value. The base user queue size estimate is updated based upon the encoded information. The base user queue size estimate influences future schedules generated by the base transceiver station.

公开(公告)号：US06556578B1

公开(公告)日：2003-04-29

申请号：US09295458

申请日：1999-04-14

申请人： Abraham Silberschatz ,  Banu Ozden ,  John Bruno ,  Huzur Saran

发明人： Abraham Silberschatz ,  Banu Ozden ,  John Bruno ,  Huzur Saran

IPC分类号： H04L1228

CPC分类号： H04L47/29 ,  H04L47/10 ,  H04L47/193 ,  H04L47/32 ,  H04L47/50 ,  H04L47/60 ,  H04L47/6225 ,  H04L47/6255 ,  H04L49/90 ,  H04L49/901 ,  H04L49/9047 ,  H04L49/9078 ,  H04L69/16 ,  H04L69/163

摘要： A method for managing a buffer pool containing a plurality of queues is based on consideration of both (a) when to drop a packet and (b) from which queue the packet should be dropped. According to the method a packet drop is signaled with the global average queue occupancy exceeds a maximum threshold and is signaled on a probabilistic basis when the global occupancy is between a minimum threshold and the maximum threshold. Each queue has a particular local threshold value associated with it and is considered to be “offending” when its buffer occupancy exceeds its local threshold. When a packet drop is signaled, one of the offending queues is selected using a hierarchical, unweighted round robin selection scheme which ensures that offending queues are selected in a fair manner. A packet is then dropped from the selected offending queue.

摘要翻译： 一种用于管理包含多个队列的缓冲池的方法是基于（a）何时丢弃分组和（b）从哪个队列丢弃分组的考虑。 根据该方法，当全局平均队列占用超过最大阈值时用信号通知分组丢弃，并且当全局占用在最小阈值和最大阈值之间时，以概率为基础发信号通知分组丢弃。 每个队列具有与其相关联的特定局部阈值，并且当其缓冲器占用超过其本地阈值时被认为是“违规”的。 当信号通知分组丢弃时，使用分层，未加权的循环选择方案选择违规队列中的一个，以确保以公平的方式选择违规队列。 然后从所选择的违规队列中丢弃一个数据包。