{"paper":{"title":"Computing Exact and Approximate Blocking Probabilities in Elastic Optical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Admela Jukan, Sandeep Kumar Singh","submitted_at":"2017-06-23T15:30:46Z","abstract_excerpt":"In this paper, we propose the first exact Markov model for connection blocking analysis in elastic optical networks, based on the occupancy status of spectrum slices on all links due to arrivals and departures of various classes of connections in a network. Since the complexity of the exact Markov model grows exponentially with the link capacity, number of links, routes, and classes of demands, we further advance the state-of-the-art in computing approximate blocking probability in elastic optical networks and propose two novel approximations, i.e., load-independent and load-dependent. These a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07747","kind":"arxiv","version":3},"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"}