Exact analysis for a class of simple, circuit-switched networks with blocking

We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at no...

Full description

Saved in:
Bibliographic Details
Published in:Advances in applied probability 1989-12, Vol.21 (4), p.952-955
Main Author: Kogan, Yaakov
Format: Article
Language:English
Subjects:
Applied sciences
Circuit properties
Customers
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Exact sciences and technology
Letters to the Editor
Switching, multiplexing, switched capacity circuits
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993
cites cdi_FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993
container_end_page 955
container_issue 4
container_start_page 952
container_title Advances in applied probability
container_volume 21
creator Kogan, Yaakov
description We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, …, p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.
doi_str_mv 10.2307/1427782
format article
fullrecord <record><control><sourceid>jstor_cross</sourceid><recordid>TN_cdi_crossref_primary_10_2307_1427782</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_2307_1427782</cupid><jstor_id>1427782</jstor_id><sourcerecordid>1427782</sourcerecordid><originalsourceid>FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993</originalsourceid><addsrcrecordid>eNp9kM1Lw0AQxRdRsFbxX9iDIoLR_Wiym6OU-gEVL3oOk0m23TZNyk5K7X_vSgseBA_DMI8fbx6PsUsp7pUW5kGOlDFWHbGBHJk0yUQ2OmYDIYRMbGbsKTsjWsRTGysG7G3yBdhzaKHZkSfuusCBYwNEvHOc_Grd1HccfcCN7xPa-h7ndcXbut92YUk8CnNeNh0ufTs7ZycOGqovDnvIPp8mH-OXZPr-_Dp-nCaorOwTmzqrLOYizY3AKrWVQgNxtMycjIFzCUrXojKuMjJTFsrUaQAsTWowz_WQ3ex9MXREoXbFOvgVhF0hRfHTQnFoIZLXe3INhNC4AC16-sVjAKm0jtzVnltQ34V_7G4Pj2FVBl_N6mLRbUJsj_6w318Mc6k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Exact analysis for a class of simple, circuit-switched networks with blocking</title><source>JSTOR Archival Journals</source><creator>Kogan, Yaakov</creator><creatorcontrib>Kogan, Yaakov</creatorcontrib><description>We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, …, p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.</description><identifier>ISSN: 0001-8678</identifier><identifier>EISSN: 1475-6064</identifier><identifier>DOI: 10.2307/1427782</identifier><identifier>CODEN: AAPBBD</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Applied sciences ; Circuit properties ; Customers ; Electric, optical and optoelectronic circuits ; Electronic circuits ; Electronics ; Exact sciences and technology ; Letters to the Editor ; Switching, multiplexing, switched capacity circuits</subject><ispartof>Advances in applied probability, 1989-12, Vol.21 (4), p.952-955</ispartof><rights>Copyright © Applied Probability Trust 1989</rights><rights>Copyright 1989 Applied Probability Trust</rights><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993</citedby><cites>FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/1427782$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/1427782$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,58238,58471</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19701233$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kogan, Yaakov</creatorcontrib><title>Exact analysis for a class of simple, circuit-switched networks with blocking</title><title>Advances in applied probability</title><addtitle>Advances in Applied Probability</addtitle><description>We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, …, p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.</description><subject>Applied sciences</subject><subject>Circuit properties</subject><subject>Customers</subject><subject>Electric, optical and optoelectronic circuits</subject><subject>Electronic circuits</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>Letters to the Editor</subject><subject>Switching, multiplexing, switched capacity circuits</subject><issn>0001-8678</issn><issn>1475-6064</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNp9kM1Lw0AQxRdRsFbxX9iDIoLR_Wiym6OU-gEVL3oOk0m23TZNyk5K7X_vSgseBA_DMI8fbx6PsUsp7pUW5kGOlDFWHbGBHJk0yUQ2OmYDIYRMbGbsKTsjWsRTGysG7G3yBdhzaKHZkSfuusCBYwNEvHOc_Grd1HccfcCN7xPa-h7ndcXbut92YUk8CnNeNh0ufTs7ZycOGqovDnvIPp8mH-OXZPr-_Dp-nCaorOwTmzqrLOYizY3AKrWVQgNxtMycjIFzCUrXojKuMjJTFsrUaQAsTWowz_WQ3ex9MXREoXbFOvgVhF0hRfHTQnFoIZLXe3INhNC4AC16-sVjAKm0jtzVnltQ34V_7G4Pj2FVBl_N6mLRbUJsj_6w318Mc6k</recordid><startdate>19891201</startdate><enddate>19891201</enddate><creator>Kogan, Yaakov</creator><general>Cambridge University Press</general><general>Applied Probability Trust</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19891201</creationdate><title>Exact analysis for a class of simple, circuit-switched networks with blocking</title><author>Kogan, Yaakov</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Circuit properties</topic><topic>Customers</topic><topic>Electric, optical and optoelectronic circuits</topic><topic>Electronic circuits</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>Letters to the Editor</topic><topic>Switching, multiplexing, switched capacity circuits</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kogan, Yaakov</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Advances in applied probability</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kogan, Yaakov</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exact analysis for a class of simple, circuit-switched networks with blocking</atitle><jtitle>Advances in applied probability</jtitle><addtitle>Advances in Applied Probability</addtitle><date>1989-12-01</date><risdate>1989</risdate><volume>21</volume><issue>4</issue><spage>952</spage><epage>955</epage><pages>952-955</pages><issn>0001-8678</issn><eissn>1475-6064</eissn><coden>AAPBBD</coden><abstract>We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L−1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, …, p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.2307/1427782</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0001-8678
ispartof Advances in applied probability, 1989-12, Vol.21 (4), p.952-955
issn 0001-8678
1475-6064
language eng
recordid cdi_crossref_primary_10_2307_1427782
source JSTOR Archival Journals
subjects Applied sciences
Circuit properties
Customers
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Exact sciences and technology
Letters to the Editor
Switching, multiplexing, switched capacity circuits
title Exact analysis for a class of simple, circuit-switched networks with blocking
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T20%3A32%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exact%20analysis%20for%20a%20class%20of%20simple,%20circuit-switched%20networks%20with%20blocking&rft.jtitle=Advances%20in%20applied%20probability&rft.au=Kogan,%20Yaakov&rft.date=1989-12-01&rft.volume=21&rft.issue=4&rft.spage=952&rft.epage=955&rft.pages=952-955&rft.issn=0001-8678&rft.eissn=1475-6064&rft.coden=AAPBBD&rft_id=info:doi/10.2307/1427782&rft_dat=%3Cjstor_cross%3E1427782%3C/jstor_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c281t-85f828c905970cd58d2c7a2c7316f106491a23e0d7fd71628ab5f3aacb757c993%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_cupid=10_2307_1427782&rft_jstor_id=1427782&rfr_iscdi=true