{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2LCYQR4I7QKGK6WPKPTWETGYSZ","short_pith_number":"pith:2LCYQR4I","schema_version":"1.0","canonical_sha256":"d2c5884788fc14657acf53e7624cd89649d8b391655719487d20bb9e388f8dc4","source":{"kind":"arxiv","id":"1511.01344","version":4},"attestation_state":"computed","paper":{"title":"Asymptotic Approximations for TCP Compound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sudheer Poojary, Vinod Sharma","submitted_at":"2015-11-04T14:20:53Z","abstract_excerpt":"In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the window sizes are continuous, i.e., a fluid behaviour is assumed. We validate this model theoretically. We show that under the deterministic loss model, the TCP window evolution for TCP Compound is periodic and is independent of the initial window size. We then consider the case when packets are lost randomly and independently of each other. We discuss Markov cha"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.01344","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-11-04T14:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"f94b37ae5ec347cf5e6038c44bf306546ab9da5f33967b901f606ecf54176859","abstract_canon_sha256":"03119e35f58d2567d49f73222e25dfee47af1d5e9df5c6c29d9907aa4ac798da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:10.098700Z","signature_b64":"eIdONYHbG5+YoNND25aiVanPgCBgc46V6lzM/xHrY0cls9+uf93Bl2uqVl/f5HA5lRGwxGe7PjFeuIbpNwtRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c5884788fc14657acf53e7624cd89649d8b391655719487d20bb9e388f8dc4","last_reissued_at":"2026-05-18T01:22:10.098151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:10.098151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Approximations for TCP Compound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Sudheer Poojary, Vinod Sharma","submitted_at":"2015-11-04T14:20:53Z","abstract_excerpt":"In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the window sizes are continuous, i.e., a fluid behaviour is assumed. We validate this model theoretically. We show that under the deterministic loss model, the TCP window evolution for TCP Compound is periodic and is independent of the initial window size. We then consider the case when packets are lost randomly and independently of each other. We discuss Markov cha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01344","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.01344","created_at":"2026-05-18T01:22:10.098237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01344v4","created_at":"2026-05-18T01:22:10.098237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01344","created_at":"2026-05-18T01:22:10.098237+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LCYQR4I7QKG","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LCYQR4I7QKGK6WP","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LCYQR4I","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ","json":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ.json","graph_json":"https://pith.science/api/pith-number/2LCYQR4I7QKGK6WPKPTWETGYSZ/graph.json","events_json":"https://pith.science/api/pith-number/2LCYQR4I7QKGK6WPKPTWETGYSZ/events.json","paper":"https://pith.science/paper/2LCYQR4I"},"agent_actions":{"view_html":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ","download_json":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ.json","view_paper":"https://pith.science/paper/2LCYQR4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01344&json=true","fetch_graph":"https://pith.science/api/pith-number/2LCYQR4I7QKGK6WPKPTWETGYSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2LCYQR4I7QKGK6WPKPTWETGYSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ/action/storage_attestation","attest_author":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ/action/author_attestation","sign_citation":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ/action/citation_signature","submit_replication":"https://pith.science/pith/2LCYQR4I7QKGK6WPKPTWETGYSZ/action/replication_record"}},"created_at":"2026-05-18T01:22:10.098237+00:00","updated_at":"2026-05-18T01:22:10.098237+00:00"}