Sentence examples for packet function from inspiring English sources
In a sense, our method proposes an extended idea where the cooperative communications are performed based on a packet function (e.g., packet size) in an optimal way.
However, ETT still uses fixed size of the probe (for data packets) and specifies the cost metric accordingly and does not mention any packet function (or packet size) -dependent path setup.
Please note that packet size is just a sample parameter for our algorithm; indeed, it can be any packet function that the network operator may choose to optimize for path setup.
In this paper, we promote the packet function (e.g., packet size) -aware extension of the Dijkstra algorithm (i.e., PFA_SPF) as a base algorithm where any routing protocol can evolve it and integrate it with appropriate routing metrics.
In other words, the AC[2] (i.e. AC_VI) in the AM algorithm is no longer a FIFO queue, but a multi-level random early detection (M-RED) queue, where each I/P/B packet follows a specific RED-like packet mapping function, i.e., this algorithm modified the random early 'drop' concept into random early 'downward mapping' to the lower-priority AC queues.
This article proposed a novel cross-layer design called DVFI+CQM, where a hyperfine video packet priority scheme based on the concept of dispersive video frame importance (DVFI) was adopted in the application layer while a corresponding AQM-based packet mapping function called comb-shaped quadratic mapping (CQM) was proposed in the MAC layer.
We call our algorithm "packet function-aware shortest-path first algorithm" (PFA_SPF).
In particular, we propose a generic algorithm for packet function-aware path setup for multi-hop networks.
In other words, in this paper, we are not proposing a complete routing protocol; instead, we are showing the potential of a packet function-aware path setup algorithm as an extension to Dijkstra over a basic fundamental network model.
Our proposal in this paper is to promote the packet function-aware extension of the Dijkstra algorithm as a base algorithm where any appropriate routing protocol can evolve and integrate it (with other routing metrics discussed above) and build on top of it.
A series of Gaussian wave packet functions are used to fit the frequency content of the new artificial record to that of the actual one.
