Patent ID: 8311056
Filing Date: 2012-11-13
Classification: H04J,H04L

Abstract:
1. A device for selecting time slots from a resource based on a path setup request according to an autonomous decentralized protocol, wherein the path setup request includes a data link identifier identifying at least one data link, a time slot size and a requested number of time slots, wherein the requested number of time slots is one of a plurality of predetermined numbers of time slots according to the predetermined autonomous decentralized protocol, the device comprising: a resource allocation section for selecting the time slots based on a use state of the resource; and a memory previously storing resource information which is retrievable using the data link identifier as a key, wherein the resource information includes the use state of the resource and a total sum of time slots including usable and unusable time slots for each data link, wherein the use state of the resource of each data link indicates whether each time slot is already used by another service, wherein the resource allocation section comprises: a resource examination section for examining the use state of the resource for each data link by searching the memory based on the data link identifier and the requested number of time slots; a candidate retrieval section for extracting an available set of contiguous time slots as a candidate based on an examination result of the resource examination section; and a decision section for selecting the time slots so as to maximize an available set of contiguous time slots of the resource to leave as large a predetermined number of time slots as possible after time slot selection based on the use state of the resource for each identified data link by referring to the time slot size and the requested number of time slots of the path setup request, wherein the time slot size is a predetermined integral multiple of a size of each time slot; wherein the decision section comprises: a first decision section for selecting a first candidate from candidates extracted by the candidate retrieval section, wherein the first candidate has a smallest number of time slots among the candidates but not smaller than the requested number of time slots; and a second decision section for selecting a second candidate as the time slots from first candidates selected by the first decision section, wherein the second candidate is adjacent to an unusable time slot or an edge point of the resource.