METHOD FOR MANAGING WIRELESS COMMUNICATION NETWORKS BY PREDICTION OF TRAFFIC PARAMETERS
A method (100) for managing a wireless network, comprising: - collecting (105) a sequence of traffic data samples ordered in time, and arranging said collected data samples in at least one level-0 residual matrix having at least one dimension, said dimension of said level-0 residual matrix correspon...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Patent |
Sprache: | eng ; fre |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A method (100) for managing a wireless network, comprising: - collecting (105) a sequence of traffic data samples ordered in time, and arranging said collected data samples in at least one level-0 residual matrix having at least one dimension, said dimension of said level-0 residual matrix corresponding to a respective time scale comprising an ordered sequence of time units, said ordered sequences of time units defining a first time window; - performing at least once a cycle, each n-th iteration of the cycle, starting from n = 0, comprising a sequence of phases A), B), C), D), E): A) for at least one dimension of a level-(n) residual matrix, subdividing (110) the corresponding time scale in such a way to group the time units thereof in a respective level-(n+1) partition of time units so as to subdivide the traffic data samples in corresponding level-(n+1) traffic data sample sets; B) for each level-(n+1) traffic data sample set, calculating (115) a corresponding functional which fits said level-(n+1) traffic data sample set; C) for each level-(n+1) traffic data sample set, calculating (115) a corresponding approximation of the level-(n+1) traffic data sample set by applying the corresponding functional to the corresponding level-(n+1) partition of time units; D) joining together (115) the approximations of the level-(n+1) traffic data sample sets to calculate a level-(n+1) approximated matrix, said level-(n+1) approximated matrix being an approximated version of the level-(n) residual matrix; E) calculating (120) the difference between the level-(n) residual matrix and the calculated level-(n+1) approximated matrix so as to obtain a level-(n+1) residual matrix; - forecasting (130) traffic data trend in a second time window different from the first time window by generating predicted data samples by applying the calculated functional to a partition of time units comprising an ordered sequence of time units corresponding to at least one among said second time window and said first time window; - using (140) said forecasted traffic data trend to manage the wireless network.
L'invention concerne un procédé (100) de gestion d'un réseau sans fil, comprenant les étapes consistant à : - recueillir (105) une séquence d'échantillons de données de trafic ordonnés chronologiquement, et disposer lesdits échantillons de données recueillis dans au moins une matrice résiduelle de niveau 0 ayant au moins une dimension, ladite dimension de ladite matrice résiduelle de nivea |
---|