Managing Communication Costs under Temporal Uncertainty
Authors: Nikhil Bhargava, Christian Muise, Tiago Vaquero, Brian Williams
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | 5 Experimental Results The search algorithms we have presented differ in key ways. Blind search and LCRS have much lower overhead but have no guarantees of optimality. In contrast, CDBFS is guaranteed to output an optimal communication protocol but can be quite slow in practice. In this section, we present our empirical analysis as a way to better characterize exactly how different these approaches are and when it might be preferable to use one over the other. |
| Researcher Affiliation | Academia | Nikhil Bhargava, Christian Muise, Tiago Vaquero, Brian Williams Massachusetts Institute of Technology {nkb, cjmuise, tvaquero, williams}@mit.edu |
| Pseudocode | Yes | Algorithm 1: Delay Controllability algorithm that reports conflicts; Algorithm 2: Function DELAYDIJKSTRA; Algorithm 3: Algorithm that performs different variants of greedy search to find a communication protocol for an input STNU that is delay controllable; Algorithm 4: Algorithm that computes minimum-cost communication protocol for an STNU. |
| Open Source Code | No | The paper does not provide any specific links or explicit statements regarding the availability of its source code. |
| Open Datasets | Yes | Our random STNUs were composed of k independent contingent links which each had a lower bound of 0 and an integer upper bound that was uniformly chosen between 1 and 4. For each pair of endpoints between distinct contingent links, we added a requirement link between the two with probability 1/(4k). Each requirement link also had a lower bound of 0 and an integer upper bound chosen uniformly between 1 and 4. |
| Dataset Splits | No | The paper describes how STNUs were generated for experiments (e.g., '50 trials each with parameters k = 10, 20, 30, 40, 50'), but it does not specify any training, validation, or test dataset splits. |
| Hardware Specification | Yes | All tests were run on a machine with an Intel i7 processor and 39GB of RAM. |
| Software Dependencies | No | The paper does not provide specific software dependencies with version numbers (e.g., programming languages, libraries, or solvers). |
| Experiment Setup | Yes | We performed 50 trials each with parameters k = 10, 20, 30, 40, 50, and for all experiments, we assumed a cost function of C(γ) = P 1/(1+γ(xe)). Our random STNUs were composed of k independent contingent links which each had a lower bound of 0 and an integer upper bound that was uniformly chosen between 1 and 4. |