Traffic Analysis of a Congested and Uncongested Network in a Sequential Server Model
Bibliographic record
Abstract
The efficient flow of messages in a communication network is crucial in today’s dynamic environment. These networks are designed to transmit messages in the shortest amount of time. The source sends the messages to the destination through single or multiple servers. Each server contains a buffer that queues the incoming messages when it is busy. This study analyzed the traffic behavior of uncongested and congested wired communication networks for limited and unlimited queue sizes in multiserver configurations with a sequential server model. The performance of the network was measured using three cases: varying the packet length, adding an extra link, and with a broken link connecting the two servers. The performance of the wired communication networks for these three cases was measured based on packet drop rate, throughput, and average end-to-end delay using the OMNeT++ network simulator. Limited and unlimited queue sizes for a sequential server in the network were implemented and simulated to measure the interarrival rate and packet length for optimum performance. For various interarrival rates, the optimum throughput was measured for different queue sizes. The performance with a broken link or the addition of an extra link was assessed and compared with the sequential server model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.004 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.005 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".