公开(公告)号：US20240236014A9

公开(公告)日：2024-07-11

申请号：US18264981

申请日：2022-02-09

Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

Inventor： Lewis VERYARD ,  Andrew HARDWICK ,  Anthony CONWAY

IPC: H04L47/762 ,  H04L47/70

CPC classification number: H04L47/762 ,  H04L47/827

Abstract: A computer implemented method of allocating a set of communications network resources to resource consumers in a digital communications system can include generating a set of multiple allocation schemes; iteratively applying a genetic algorithm to the set of allocation schemes to generate, at each iteration, a new set of allocation schemes as a generation of allocation schemes based on a preceding generation; and, responsive to a predetermined stopping condition for the iteration, assigning resource consumers to resources in the communications system in accordance with an allocation scheme in a most recent generation determined to satisfy a ranking condition.

公开(公告)号：US20240137330A1

公开(公告)日：2024-04-25

申请号：US18264981

申请日：2022-02-09

Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

Inventor： Lewis VERYARD ,  Andrew HARDWICK ,  Anthony CONWAY

IPC: H04L47/762 ,  H04L47/70

CPC classification number: H04L47/762 ,  H04L47/827

Abstract: A computer implemented method of allocating a set of communications network resources to resource consumers in a digital communications system can include generating a set of multiple allocation schemes; iteratively applying a genetic algorithm to the set of allocation schemes to generate, at each iteration, a new set of allocation schemes as a generation of allocation schemes based on a preceding generation; and, responsive to a predetermined stopping condition for the iteration, assigning resource consumers to resources in the communications system in accordance with an allocation scheme in a most recent generation determined to satisfy a ranking condition.

公开(公告)号：US20220094624A1

公开(公告)日：2022-03-24

申请号：US17310017

申请日：2019-12-18

Applicant: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY

Inventor： Andrew STARKEY ,  Lewis VERYARD ,  Hani HAGRAS ,  Gilbert OWUSU

IPC: H04L45/128 ,  H04L45/28 ,  H04L45/00

Abstract: A computer implemented method of determining non-intersecting primary and secondary routes between source and destination nodes in a communications network. The communication network represented by a graph data structure of nodes and edges, the edges having a weight corresponding to a resource involved in traversing the edged. The method including: defining a population set of primary routes, wherein each primary route in the population set identifies a secondary route based on a greedy route-finding algorithm applied to the graph having edges in the primary route excluded from the graph, such that the primary and secondary routes are non-intersecting routes through the graph; applying a genetic algorithm to the population set to iteratively select and crossover one or more pairs of primary routes in the population set; and selecting, from the population set, a primary route and corresponding secondary route having a lowest aggregate weight of edges.