The phrase "aggregate traffic flow" is correct and usable in written English.
It can be used in contexts related to transportation, data analysis, or network performance, where you are discussing the total or combined flow of traffic over a certain period or area.
Example: "The study analyzed the aggregate traffic flow during peak hours to identify congestion patterns."
Alternatives: "total traffic flow" or "combined traffic flow".
In (6), the self-similar aggregate traffic flow is modelled by an FBM process.
Papageorgiou et al. [17] utilized the data of a German motorway to investigate the impact on aggregate traffic flow behavior and efficiency.
Due to self-similarity of the aggregate traffic flow, we use the FBM model in (6) to capture the data arrival process.
As the aggregate traffic exhibits self-similarity, we use a FBM process to characterize the aggregate traffic flow beyond the wireless gateway.
In particular, the cumulative arrival process of an aggregate traffic flow, denoted by Λ t), can be approximated by an FBM process as follows Λ ( t ) = m t + a m Z ( t ) (6).
where H = ( C A - m ) ( 1 - H ) 2 H a m ( 1 - H ) 2 H 2 H (16). and C A (bps) is the transmission rate of cellular relay channel for aggregate traffic and m is the mean arrival rate of the aggregate traffic flow per second.
Although aggregate traffic flows are close to equilibrium levels, we see some systematic deviations from equilibrium.
This could be the case for SLAs for which the aggregate traffic flows have e.g., exceeded the agreed data volume.
First, in WMN, each mesh router aggregates traffic flows for a large number of mobile clients, and therefore the aggregate traffic load changes infrequently, which offers the predictability for assigning channel width in term of traffic pattern and permits capacity optimization based on estimated traffic demand.
In some previous works, we have demonstrated that suitable traffic shaping of packet flows that are subsequently multiplexed at a network node can permit the application of the M/G/1 model for performance modelling and control of the aggregate traffic stream.
All flows share a single FIFO buffer; (b) provides isolation between flows using per-flow queues and limits the aggregate traffic through the interface; (c) enforces per-flow rate limiting, with rate R1 for Flow 1, R2 for Flow 2, etc. TCP flows sharing a single queue are susceptible to synchronization due to bursty and correlated packet losses.
