公开(公告)号：US09654937B2

公开(公告)日：2017-05-16

申请号：US14664101

申请日：2015-03-20

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Sateesh K. Addepalli ,  Raghuram S. Sudhaakar ,  Lillian Lei Dai ,  Vina Ermagan ,  Preethi Natarajan ,  Kevin C. Lee ,  Pere Monclus

IPC: H04L12/16 ,  H04W4/04 ,  H04W72/04 ,  H04W28/06 ,  H04W52/12 ,  G06F9/54 ,  H04W48/06 ,  H04W48/18 ,  B60W50/10 ,  G06F3/01 ,  G06F3/16 ,  H04L12/26 ,  H04L29/06 ,  H04W12/08 ,  G06F21/45 ,  H04W12/06 ,  H04W28/02 ,  H04W40/20 ,  H04W48/02 ,  H04L29/08 ,  B60R16/023 ,  H04L12/721 ,  H04L29/12 ,  H04W8/06 ,  H04W8/08 ,  H04W8/26 ,  H04W40/02 ,  H04L1/00 ,  H04W4/00 ,  H04W4/10 ,  H04W12/02 ,  H04W12/04 ,  H04W76/00 ,  H04W80/02 ,  H04W84/00 ,  H04W36/08 ,  H04W52/14 ,  H04W52/22 ,  H04W52/24 ,  H04W52/34 ,  H04W84/12 ,  H04W92/18

CPC classification number: H04W4/046 ,  B60R16/023 ,  B60W50/10 ,  G06F3/017 ,  G06F3/167 ,  G06F9/542 ,  G06F21/45 ,  H04L1/008 ,  H04L29/06578 ,  H04L43/0811 ,  H04L43/0858 ,  H04L43/0876 ,  H04L45/12 ,  H04L51/02 ,  H04L61/2592 ,  H04L63/08 ,  H04L63/107 ,  H04L67/12 ,  H04L67/32 ,  H04L69/18 ,  H04Q9/00 ,  H04W4/00 ,  H04W4/10 ,  H04W8/06 ,  H04W8/08 ,  H04W8/26 ,  H04W12/02 ,  H04W12/04 ,  H04W12/06 ,  H04W12/08 ,  H04W28/0215 ,  H04W28/06 ,  H04W36/08 ,  H04W40/02 ,  H04W40/20 ,  H04W48/02 ,  H04W48/06 ,  H04W48/16 ,  H04W48/18 ,  H04W52/12 ,  H04W52/143 ,  H04W52/225 ,  H04W52/241 ,  H04W52/346 ,  H04W72/0406 ,  H04W72/042 ,  H04W72/0493 ,  H04W76/45 ,  H04W80/02 ,  H04W84/005 ,  H04W84/12 ,  H04W92/18 ,  Y02A30/60

Abstract: A method includes selecting a path for routing a data packet from a source node to a destination node in a vehicular ad hoc network, storing the data packet if the selected path is identified as a dead end, and establishing a communication link with a first node. The method also includes forwarding the data packet to the first node if a first distance between the first node and the destination node is less than a second distance between the source node and the destination node. More specific embodiments include sending a query for location information of the destination node, receiving the location information including two or more available paths from the source node to the destination node, and determining the path for routing the data packet is an optimal path of the two or more available paths.

公开(公告)号：US09246829B2

公开(公告)日：2016-01-26

申请号：US13874600

申请日：2013-05-01

Applicant: Cisco Technology, Inc.

Inventor： Rong Pan ,  Preethi Natarajan ,  Chiara Piglione ,  Mythili Suryanarayana Prabhu ,  Frederick Juergens Baker ,  Bill Carroll VerSteeg ,  Vijaynarayanan Subramanian

IPC: H04L12/801 ,  H04L12/835 ,  H04L12/851 ,  H04L12/823 ,  H04L12/863 ,  H04L12/841

CPC classification number: H04L47/32 ,  H04L47/127 ,  H04L47/283 ,  H04L47/30 ,  H04L47/6255

Abstract: In one embodiment, a method includes estimating a current queuing latency, the estimated current queuing latency being associated with a queue of packets maintained in a buffer. The method also includes calculating a current drop or mark probability, the current drop or mark probability being associated with a probability that packets associated with the queue of packets will be dropped or marked. A rate at which the packets associated with the queue of packets are dequeued from the buffer is estimated in order to estimate the current queuing latency. The current drop or mark probability is calculated using the current estimated queuing latency.

Abstract translation: 在一个实施例中，一种方法包括估计当前排队延迟，所估计的当前排队等待时间与保持在缓冲器中的分组队列相关联。 该方法还包括计算当前下降或标记概率，当前丢弃或标记概率与丢弃或标记与分组队列相关联的分组的概率相关联。 与缓冲区队列相关联的分组的速率被估计为估计当前排队等待时间。 使用当前估计的排队延迟来计算当前的下降或标记概率。