DYNAMIC CHANNEL ALLOCATION WITH INTERNET NETWORK LINK

摘要

At most, N resources, an ISDN line channels or analog links, are allocated to an amount of information (X) conveyed by IP packets. Each channel occupation is charged according to a basic price PB for a time credit CT then for a time unit price PU. The invention aims at optimising resource occupancy in the network, access performance and user costs. The allocation and clearance of the resources are carried out without inertia by processing information with size of data to be received. The communication cost depends on the number of channels actually required for the amount of information. Said amount (X) is compared to N-1 thresholds (SP1, SPN-1) depending on PB, CT and PU. The number of channels allocated in the rank (n) of the threshold (SPn) immediately higher than said amount. The information is systematically transferred in the N channels if rapidity of communication (E2 - E6) is being favoured.