公开(公告)号：US20160105376A1

公开(公告)日：2016-04-14

申请号：US14845078

申请日：2015-09-03

Applicant: NEC Laboratories America, Inc.

Inventor： Neda Cvijetic ,  Konstantinos Kanonakis ,  Ting Wang ,  Jing Wang

IPC: H04L12/911 ,  H04L12/26 ,  H04L29/08

CPC classification number: H04L47/821 ,  H04L43/08 ,  H04L67/12

Abstract: A system and method for network virtualization and resource allocation, including storing one or more received network requests in a request table, and updating at least one of a flow table, a waiting list table, or a candidate group map based on the one or more received network requests. The updating includes monitoring a transmission progress of each of one or more flows in a network of interconnected computing devices and moving completed flows from the flow table to a success list, moving requests in the waiting list table which have reached an attempt threshold from the flow table to a fail list, and compiling any residual requests in the waiting list with new requests to generate a new request table. A deterministic request allocation and/or an optimizing request allocation is performed based on the new request table.

Abstract translation: 一种用于网络虚拟化和资源分配的系统和方法，包括将一个或多个所接收的网络请求存储在请求表中，以及基于所述一个或多个基于所述流表，等待列表或候选组映射中的至少一个来更新 收到网络请求。 所述更新包括监视互连计算设备的网络中的一个或多个流中的每一个的传输进度，并将完成的流从流表移动到成功列表，从等待流程中移动已经达到尝试阈值的等待列表中的请求 表到失败列表，并用新的请求编译等待列表中的任何剩余请求以生成新的请求表。 基于新的请求表执行确定性请求分配和/或优化请求分配。

公开(公告)号：US10116590B2

公开(公告)日：2018-10-30

申请号：US14845078

申请日：2015-09-03

Applicant: NEC Laboratories America, Inc.

Inventor： Neda Cvijetic ,  Konstantinos Kanonakis ,  Ting Wang ,  Jing Wang

IPC: H04L12/911 ,  H04L12/26 ,  H04L29/08

Abstract: A system and method for network virtualization and resource allocation, including storing one or more received network requests in a request table, and updating at least one of a flow table, a waiting list table, or a candidate group map based on the one or more received network requests. The updating includes monitoring a transmission progress of each of one or more flows in a network of interconnected computing devices and moving completed flows from the flow table to a success list, moving requests in the waiting list table which have reached an attempt threshold from the flow table to a fail list, and compiling any residual requests in the waiting list with new requests to generate a new request table. A deterministic request allocation and/or an optimizing request allocation is performed based on the new request table.