{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T06:40:27Z","timestamp":1698561627488},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3787,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Deeper investigation is needed for several open issues related to congestion and admission control within the field of the high speed <jats:italic>B<\/jats:italic>\u2010ISDN network with ATM protocol. The system must be more effective in resource management and robust enough to cope with changes in traffic environment, which nowadays is characterised by sophisticated multimedia services. In this paper a new admission and congestion control strategy is proposed. It originates from the Fast Buffer Reservation (FBR) scheme, a virtual circuit acceptance algorithm proposed by Prof. Turner, and enhances its effectiveness, thus resulting in a complete approach for bandwidth management. The scheme is called Modified FBR (M\u2010FBR). The use of the FBR method, in fact, when based on the powerful Excess Probability Criterion (EPC), seemed to be impeded by the occurrence of lock out problems. By adopting a new kind of service at the buffer exit, the new mechanism offers the required flexibility and robustness, as well as ease of control, while preserving burst integrity and exhibiting a high burst\u2010served to burst\u2010sent ratio.<\/jats:p>","DOI":"10.1002\/ett.4460090302","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T16:34:26Z","timestamp":1221237266000},"page":"229-235","source":"Crossref","is-referenced-by-count":0,"title":["A modified fast buffer reservation algorithm (M\u2010FBR) for congestion control in ATM networks"],"prefix":"10.1002","volume":"9","author":[{"given":"Antonio","family":"Iera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Marano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Beraldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1982.tb03089.x"},{"issue":"6","key":"e_1_2_1_3_2","first-page":"856","article-title":"A markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance","volume":"4","author":"Heffes H.","year":"1986","journal-title":"IEEE Journal"},{"issue":"8","key":"e_1_2_1_4_2","first-page":"833","article-title":"Characterizing superposition arrival process in packet multiplexors for voice and data","volume":"4","author":"Sriram K.","year":"1986","journal-title":"IEEE Journal"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(90)90025-N"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"J. S.Turner:Managing bandwidth in ATM networks with bursty traffic. \u201cIEEE Network\u201d Sep.1992.","DOI":"10.1109\/65.157032"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"A. E.Eckberg:A B\u2010ISDN\/ATM traffic and congestion control. \u201cIEEE Network\u201d Sep.1992.","DOI":"10.1109\/65.157030"},{"key":"e_1_2_1_8_2","unstructured":"R.Beraldi F.Calonico A.Lera S.Marano:Call admission control and resource utilization in ATM networks: a new improvement strategy. \u201cProc. of IEEE GLOBECOM 94\u201d p.224\u2013229."},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"A.Demers S.Keshav S.Shenker:Analysis and simulation of a fair queuing algorithm. SIGCOM'89 Austin Texas Sep.1989 p.1\u201312.","DOI":"10.1145\/75247.75248"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_2_1_11_2","unstructured":"S. J.Golestani:A self\u2010clocked fair queuing scheme for broadband applications. INFOCOM'94 Toronto Canada p.639\u2013646."}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460090302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460090302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T11:25:55Z","timestamp":1698492355000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460090302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1002\/ett.4460090302"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460090302","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}