The Web3 Gaming Network
PRACTICE100:00+4 −1MCQ Single Answer
Data / Set
Study the network topology table and the server constraints to answer the questions that follow. The dataset represents a decentralized Web3 gaming network.
The Meta (Constraints):
1. Processing Penalty: Every time a data packet passes *through* an intermediate server node (any node that is not the start or the final destination), it gets hit with a flat processing delay of ms and an automatic routing fee of Tokens.
2. Zero Redundancy: A data packet cannot visit the same node twice in a single trip (no loops, touch grass).
| Data Link (Bi-directional) | Ping Delay (ms) | Gas Fee (Tokens) |
|---|---|---|
| A ↔ B | 15 | 30 |
| A ↔ C | 20 | 10 |
| B ↔ D | 25 | 40 |
| C ↔ D | 10 | 50 |
| C ↔ E | 35 | 20 |
| D ↔ E | 15 | 25 |
| D ↔ F | 20 | 30 |
| E ↔ F | 10 | 15 |
To test network resilience, the devs simulate a sweaty round-trip ping. Packet 1 travels from Node A to Node F using the route with the absolute lowest Total Gas Fee. Immediately after, Packet 2 returns from Node F to Node A using the route with the absolute *highest* Total Gas Fee without violating the "touch grass" zero-redundancy rule (no loops). What is the combined Gas Fee of both packets?