Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths

Mugurel Ionut Andreica, Nicolae Tapus

Open source

DOI: 10.1109/synasc.2008.61
Published: 2008
Container: 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Publisher: IEEE
Open access: unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

supportingDOI registered: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
supportingDOI resolves: A matching record was returned by Crossref. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1109/synasc.2008.61,
  title = {Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths},
  author = {Mugurel Ionut Andreica and Nicolae Tapus},
  year = {2008},
  journal = {2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing},
  doi = {10.1109/synasc.2008.61},
  url = {https://doi.org/10.1109/synasc.2008.61}
}

RIS

TY  - JOUR
TI  - Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths
AU  - Mugurel Ionut Andreica
AU  - Nicolae Tapus
PY  - 2008
JO  - 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
DO  - 10.1109/synasc.2008.61
UR  - https://doi.org/10.1109/synasc.2008.61
ER  -

APA

Andreica, M. I., & Tapus, N. (2008). Optimal Scheduling of Two Communication Flows on Multiple Disjoint Packet-Type Aware Paths. 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. https://doi.org/10.1109/synasc.2008.61

Source records

crossref · retrieved 2026-09-25T01:16:07.542Z