A linear-based trunk reservation routing algorithm for ATM networks
In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the...
Saved in:
| Published in | International journal of communication systems Vol. 12; no. 2; pp. 125 - 141 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Chichester, UK
John Wiley & Sons, Ltd
01.03.1999
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1074-5351 1099-1131 |
| DOI | 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E |
Cover
| Abstract | In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the load‐balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real‐time application render it as an efficient routing algorithm for ATM networks. Copyright © 1999 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade‐off between the use of the minimum‐hop routes and the application of the load‐balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real‐time application render it as an efficient routing algorithm for ATM networks. Copyright © 1999 John Wiley & Sons, Ltd. In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade-off between the use of the minimum-hop routes and the application of the load-balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks. |
| Author | Baltatzis, Evangelos D. Venieris, Iakovos S. Stassinopoulos, George I. Atlasis, Antonios F. |
| Author_xml | – sequence: 1 givenname: Antonios F. surname: Atlasis fullname: Atlasis, Antonios F. email: atlasis@telecom.ece.ntua.gr organization: National Technical University of Athens, Electrical and Computer Engineering Department, Heroon Polytechniou 9, Zographou, GR-157 73 Athens, Greece – sequence: 2 givenname: Evangelos D. surname: Baltatzis fullname: Baltatzis, Evangelos D. organization: National Technical University of Athens, Electrical and Computer Engineering Department, Heroon Polytechniou 9, Zographou, GR-157 73 Athens, Greece – sequence: 3 givenname: George I. surname: Stassinopoulos fullname: Stassinopoulos, George I. organization: National Technical University of Athens, Electrical and Computer Engineering Department, Heroon Polytechniou 9, Zographou, GR-157 73 Athens, Greece – sequence: 4 givenname: Iakovos S. surname: Venieris fullname: Venieris, Iakovos S. organization: National Technical University of Athens, Electrical and Computer Engineering Department, Heroon Polytechniou 9, Zographou, GR-157 73 Athens, Greece |
| BookMark | eNqFkE1P3DAQhq0KJL76H3IrHLzYnjiJt1WlEBZYCXYrQYuqHkZO4tB0szG1swX-PYmCuBSJy8xo3pnn8OyRrda2hpCUswlnTBwfXs-z-RFnSlHOgR9ypRSDYxYecTEVX7iQ02k6P6WnaQaKfYUJm2TLz4LOPpDd16-tYY5DKkHyHbLn_R_GWCIiuUuyNGjq1mhHc-1NGXRu064CZ7xx_3RX2zZwdtPV7V2gmzvr6u73OqisC9Kbq6A13YN1K39AtivdePPxpe-T72ezm-yCXi7P51l6SQtIFKNaiqQoDeRK5KDLmJtKKVFFWkMexpIJgCTkYZ6UrIh4XqqiUlUVsVJqE6pIwz75NHLvnf27Mb7Dde0L0zS6NXbjMZYQAZeh7C9_jpeFs947U-G9q9faPSFnOHhFHLziYAgHQzh6RRYiFyj6IhF7rzh6xT7BbNkHs579a2Q_1I15-g_8PvdN7Mump9ORXvvOPL7StVthFEMs8XZxjnC7ODlbfPuBAM-my5z0 |
| Cites_doi | 10.1016/0140-3664(94)90025-6 10.1016/S0140-3664(98)00122-4 10.1109/26.2815 10.1016/S0169-7552(09)80008-1 10.1002/net.3230090303 |
| ContentType | Journal Article |
| Copyright | Copyright © 1999 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 1999 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E |
| DatabaseName | Istex CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1099-1131 |
| EndPage | 141 |
| ExternalDocumentID | 10_1002__SICI_1099_1131_199903_04_12_2_125__AID_DAC390_3_0_CO_2_E DAC390 ark_67375_WNG_3WNBFNPV_3 |
| Genre | article |
| GroupedDBID | .3N .GA .Y3 05W 0R~ 10A 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABEML ABIJN ABPVW ACAHQ ACBWZ ACCZN ACGFS ACIWK ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN AEFGJ AEIGN AEIMD AENEX AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AIDQK AIDYY AIQQE AITYG AIURR AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CMOOK CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD ESX F00 F01 F04 FEDTE G-S G.N GNP GODZA H.T H.X HF~ HGLYW HHY HVGLF HZ~ I-F IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MK~ ML~ MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI Q.N Q11 QB0 QRW R.K RIWAO ROL RX1 RYL SAMSI SUPJJ TUS UB1 V2E W8V W99 WBKPD WIH WIK WLBEL WOHZO WQJ WXSBR WYISQ XG1 XV2 ZZTAW ~IA ~WT AAHHS ACCFJ ADZOD AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE RWI WRC WWI AAYXX CITATION 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c3890-a528cde3b92b3ad71ef992f6aa3b47502338414b8d0c61bd9cf9ff60d5ae496a3 |
| IEDL.DBID | DR2 |
| ISSN | 1074-5351 |
| IngestDate | Thu Oct 02 04:50:44 EDT 2025 Wed Oct 01 03:17:42 EDT 2025 Wed Jan 22 16:33:51 EST 2025 Sun Sep 21 06:21:46 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | http://doi.wiley.com/10.1002/tdm_license_1.1 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3890-a528cde3b92b3ad71ef992f6aa3b47502338414b8d0c61bd9cf9ff60d5ae496a3 |
| Notes | ArticleID:DAC390 istex:2C6CF98C3CA71413EC9E821296708407328EF883 ark:/67375/WNG-3WNBFNPV-3 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 753631545 |
| PQPubID | 23500 |
| PageCount | 17 |
| ParticipantIDs | proquest_miscellaneous_753631545 crossref_primary_10_1002__SICI_1099_1131_199903_04_12_2_125__AID_DAC390_3_0_CO_2_E wiley_primary_10_1002_SICI_1099_1131_199903_04_12_2_125_AID_DAC390_3_0_CO_2_E_DAC390 istex_primary_ark_67375_WNG_3WNBFNPV_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1999-03 March/April 1999 1999-03-00 19990301 |
| PublicationDateYYYYMMDD | 1999-03-01 |
| PublicationDate_xml | – month: 03 year: 1999 text: 1999-03 |
| PublicationDecade | 1990 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | International journal of communication systems |
| PublicationTitleAlternate | Int. J. Commun. Syst |
| PublicationYear | 1999 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, 1962. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987. D. Topkis, 'A k shortest path algorithm for adaptive routing in communications networks', IEEE Trans. Commun., 36(7), 855-859 (1988). R. Guerin, H. Ahmadi and M. Naghshineh, 'Equivalent capacity and its applications in high-speed networks', IEEE J-SAC, 9(7), 968-981 (1991). S. Bahk and M. El Zarki, 'Congestion control based dynamic routing in ATM networks', Comput. Commun., 17(12), 826-835 (1994). A. Atlasis, M. Saltouros and V. Vasilakos, 'On the use of a stochastic estimator learning algorithm to the ATM routing problem: a methodology', Comput. Commun., 21, 538-546 (1998). H. Ahmadi, J. Chen and R. Guerin, 'Dynamic routing and call control in high-speed integrated networks', ITC-13, 397-403 (1992). A. Law and W. Kelton, Simulation Modelling and Analysis, McGraw-Hill, New York, 1991. N.F. Huang, C.S. Wu and Y.J. Wu, 'Some routing problems on broadband ISDN', Comput. Networks ISDN Systems, 27, 101-116 (1994). D. Shier, 'On algorithms for finding the k shortest paths in a network', Networks, 9, 195-214 (1979). 1987 1996 1962 1994; 27 1992 1994; 17 1991 1998; 21 1991; 9 1988; 36 1979; 9 Lorenz (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB12) Topkis (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB9) 1988; 36 Ford (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB7) 1962 Huang (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB4) 1994; 27 Bahk (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB5) 1994; 17 (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB18) 1996 Shier (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB8) 1979; 9 Guerin (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB13) Guerin (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB16) 1991; 9 ATM Forum (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB2) 1996 ITU-T (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB1) 1996 Bertsekas (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB6) 1987 Ahmadi (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB10) 1992 Cidon (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB15) Matta (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB14) Law (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB17) 1991 Bae (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB3) Atlasis (10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB11) 1998; 21 |
| References_xml | – reference: A. Law and W. Kelton, Simulation Modelling and Analysis, McGraw-Hill, New York, 1991. – reference: A. Atlasis, M. Saltouros and V. Vasilakos, 'On the use of a stochastic estimator learning algorithm to the ATM routing problem: a methodology', Comput. Commun., 21, 538-546 (1998). – reference: D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1987. – reference: D. Shier, 'On algorithms for finding the k shortest paths in a network', Networks, 9, 195-214 (1979). – reference: N.F. Huang, C.S. Wu and Y.J. Wu, 'Some routing problems on broadband ISDN', Comput. Networks ISDN Systems, 27, 101-116 (1994). – reference: H. Ahmadi, J. Chen and R. Guerin, 'Dynamic routing and call control in high-speed integrated networks', ITC-13, 397-403 (1992). – reference: D. Topkis, 'A k shortest path algorithm for adaptive routing in communications networks', IEEE Trans. Commun., 36(7), 855-859 (1988). – reference: S. Bahk and M. El Zarki, 'Congestion control based dynamic routing in ATM networks', Comput. Commun., 17(12), 826-835 (1994). – reference: L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, 1962. – reference: R. Guerin, H. Ahmadi and M. Naghshineh, 'Equivalent capacity and its applications in high-speed networks', IEEE J-SAC, 9(7), 968-981 (1991). – volume: 17 start-page: 826 issue: 12 year: 1994 end-page: 835 article-title: Congestion control based dynamic routing in ATM networks publication-title: Comput. Commun. – start-page: 219 end-page: 230 – start-page: 397 year: 1992 end-page: 403 article-title: Dynamic routing and call control in high‐speed integrated networks publication-title: ITC‐13 – volume: 21 start-page: 538 year: 1998 end-page: 546 article-title: On the use of a stochastic estimator learning algorithm to the ATM routing problem: a methodology publication-title: Comput. Commun. – volume: 36 start-page: 855 issue: 7 year: 1988 end-page: 859 article-title: A k shortest path algorithm for adaptive routing in communications networks publication-title: IEEE Trans. Commun. – year: 1962 – volume: 27 start-page: 101 year: 1994 end-page: 116 article-title: Some routing problems on broadband ISDN publication-title: Comput. Networks ISDN Systems – year: 1987 – year: 1996 – volume: 9 start-page: 195 year: 1979 end-page: 214 article-title: On algorithms for finding the k shortest paths in a network publication-title: Networks – year: 1991 – start-page: 75 end-page: 83 – volume: 9 start-page: 968 issue: 7 year: 1991 end-page: 981 article-title: Equivalent capacity and its applications in high‐speed networks publication-title: IEEE J‐SAC – start-page: 92 end-page: 100 – start-page: 827 end-page: 831 – ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB12 – ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB15 – volume: 17 start-page: 826 year: 1994 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB5 publication-title: Comput. Commun. doi: 10.1016/0140-3664(94)90025-6 – volume: 21 start-page: 538 year: 1998 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB11 publication-title: Comput. Commun. doi: 10.1016/S0140-3664(98)00122-4 – volume: 9 start-page: 968 year: 1991 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB16 publication-title: IEEE J-SAC – year: 1996 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB18 – year: 1996 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB1 – start-page: 397 year: 1992 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB10 publication-title: ITC-13 – ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB3 – volume: 36 start-page: 855 year: 1988 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB9 publication-title: IEEE Trans. Commun. doi: 10.1109/26.2815 – year: 1996 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB2 – volume-title: Simulation Modelling and Analysis year: 1991 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB17 – ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB13 – volume-title: Flows in Networks year: 1962 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB7 – volume: 27 start-page: 101 year: 1994 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB4 publication-title: Comput. Networks ISDN Systems doi: 10.1016/S0169-7552(09)80008-1 – volume-title: Data Networks year: 1987 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB6 – ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB14 – volume: 9 start-page: 195 year: 1979 ident: 10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E-BIB8 publication-title: Networks doi: 10.1002/net.3230090303 |
| SSID | ssj0008265 |
| Score | 1.470942 |
| Snippet | In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 125 |
| SubjectTerms | Algorithms Asynchronous transfer mode ATM call admission control Computer networks Networks quality of service routing Routing (telecommunications) Traffic engineering Traffic flow trunk reservation Trunks virtual channel connection virtual path |
| Title | A linear-based trunk reservation routing algorithm for ATM networks |
| URI | https://api.istex.fr/ark:/67375/WNG-3WNBFNPV-3/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2F%28SICI%291099-1131%28199903%2F04%2912%3A2%3C125%3A%3AAID-DAC390%3E3.0.CO%3B2-E https://www.proquest.com/docview/753631545 |
| Volume | 12 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1099-1131 dateEnd: 20241105 omitProxy: true ssIdentifier: ssj0008265 issn: 1074-5351 databaseCode: ABDBF dateStart: 19940101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVWIB databaseName: Wiley Online Library - Core collection (SURFmarket) issn: 1074-5351 databaseCode: DR2 dateStart: 19960101 customDbUrl: isFulltext: true eissn: 1099-1131 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008265 providerName: Wiley-Blackwell |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV1bb9MwFLamISF44I4oN_mBoe0hbXxJ0hSElGUpK9I6NDq2N8tJHECFFKWthHiCf8Bv4KfxSzgnTtoNkHhCSLkplnyOjo_t78THXwh5ZMBN-pJlTk1yJzOROyFEAY4OCq41L4xb4Ebhg7G_fyxfnHqnG-RruxfG8kOsPrhhz6jHa-zgOp331qShAMBejeIRBMy4uOMwJhhSGwHgcZGLwJVYwqGd4YxhGocnOKLRnrMXxRDpb4lEdN1ufLgldrmTwCjOhF8HZUdrAioA316btegJj10kUaNBbxul76xkb1vJPVfuMD7gT0HiYLCW9szKegKSzs2AF7AxP52Dt2dBcj3LDa-S7619bHLLtLtcpN3s8y_Ukf_VgNfIlQZD08g6_XWyYcob5PIZZsWbJIkoKqirH1--4USd00W1LKcUN1s1X6FpNVtizjfV79_MqneLtx8oAHgaTQ5oaXPj57fI8TCZxPtO88cIJwPg5Tra4_0sNyINeSp0HjBThCEvfK1FKgEbcYGOKdN-7mY-S_MwK8Ki8N3c00aGvha3yWY5K80dQiVS-QUp9_taypC7KdOAXQO4G7BRP-uQo7YV1UdLDKIsBTRXCu2Ka_uhQqsqa1PlSsW44nDxlAI7KmtHBSUqPoSCpEMe1_6wqlFXU8y8Czx1Mn6uxMl4dzh--VqJDqGtwygYD3CRR5dmtpwrCD99gbi4QyZ16_-m3d-V-6NuzZu7_6bae-SSJcTA7L77ZBOcwjwAuLdIH9Y98ieocC7W |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV1bb9MwFLbGJsF44I5Wrn5gaHtIm9jOrSCkLEtpYe2m0bG9Wc4NUCFFWSshnhC_gP_AP-OXcE6ctBsg8YSQclMs-RwdH8ffsY-_EPIoAzfxhJUYFcmdSHhq-BAFGMrNmVIsz8wcNwoPR07_SLw4sU9WyNdmL4zmh1hMuGHPqL7X2MFxQrqzZA0FBPZqEA4gYsbVHcOyuIXcRoB4TCQjMAWWMGhoOEMYx-EJjmCwa-wGIYT6mzzibbMd7m_yHWZEF8iacCDaQWB1uKSgAvhtN3mLNretiySoVehsofjthfAtLbpjim2LddlTENntLsU908KegKhzY-AaNuencwD3LEyuxrneVfK9sZBOb5m057O4nXz-hTzy_5rwGrlSw2gaaL-_Tlay4ga5fIZc8SaJAooaqvLHl284Vqd0Vs6LCcX9VvVENC2nc0z7pur9m2n5bvb2AwUMT4PxkBY6Pf70FjnqReOwb9Q_jTASwF6moWzmJWnGY5_FXKWuleW-z3JHKR4LgEeMo2-K2EvNxLHi1E9yP88dM7VVJnxH8dtktZgW2QahAtn83Jg5nhLCZ2ZsKYCvLtwzsJGXtMhh04zyo-YGkZoFmkmJdsXlfV-iVaW2qTSFtJhkcLGlBDtKbUcJJTLch4KoRR5XDrGoUZUTTL5zbXk8ei758WinNzp4LXmL0MZjJHwScJ1HFdl0fiohAnU4QuMWGVfN_5t2f1fuj7rVb-78m2ofkkv98XBP7g1GL--Sdc2Pgcl-98gqOEh2H9DfLH5Qdc-f4wsy9w |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwxV1bb9MwFLbGJk3wwB1Rrn5gaHtIG1-SJgUhZWnLCiybRsf2ZjmJA6iQTl0rIZ4Qv4D_wD_jl3BO3LQbIPGEkHJTLPkcHR_nfLaPvxDyyICbBJJlTkVyJzOROyGMAhzdLrjWvDBugRuFdxN_51C-OPaOV8jXei-M5YdYTLhhz6i-19jBzUletJasoYDAXg_iAYyYcXXHYUww5DYCxOMiGYErsYRDQ8MZQxyHJziiQdfpRjEM9TdETzTdZry3Iba507tA1qQXBpgW2D1YUlAB_PbqvEVPeGydRHMVWpsofmshfNOKbrlyi_EOfwoiO52luGdW2BMQdS4GrmFzfjoHcM_C5CrO9a-Q77WFbHrLqDmbps3s8y_kkf_XhFfJ5TmMppH1-2tkxZTXyaUz5Io3SC-iqKGe_PjyDWN1TqeTWTmiuN9qPhFNJ-MZpn1T_eHtePJ--u4jBQxPo-EuLW16_OlNctjvDeMdZ_7TCCcD7OU62uNBlhuRhjwVOm8zU4QhL3ytRSoBHnGBvinTIHczn6V5mBVhUfhu7mkjQ1-LW2S1HJfmNqES2fzaKfcDLWXI3ZRpgK9tuBuwUZA1yEHdjOrEcoMoywLNlUK74vJ-qNCqytpUuVIxrjhcPKXAjsraUUGJivegoNcgjyuHWNSoJyNMvmt76ih5rsRRst1P9t8o0SC09hgFnwRc59GlGc9OFYxAfYHQuEGGVfP_pt3flfujbvM3d_5NtQ_J-n63r14Nkpd3yUVLj4G5fvfIKviHuQ_gb5o-qHrnTz_GMns |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+linear-based+trunk+reservation+routing+algorithm+for+ATM+networks&rft.jtitle=International+journal+of+communication+systems&rft.au=Atlasis%2C+Antonios+F&rft.au=Baltatzis%2C+Evangelos+D&rft.au=Stassinopoulos%2C+George+I&rft.au=Venieris%2C+Iakovos+S&rft.date=1999-03-01&rft.issn=1074-5351&rft.volume=12&rft.issue=2&rft.spage=125&rft.epage=141&rft_id=info:doi/10.1002%2F%28SICI%291099-1131%28199903%2F04%2912%3A2%3C125%3A%3AAID-DAC390%3E3.0.CO%3B2-E&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1074-5351&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1074-5351&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1074-5351&client=summon |