Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253396
F. Bernabei, L. Gratta, M. Listanti, A. Sarghini
The multiplexing of shaped on-off sources on an asynchronous transfer mode (ATM) link is addressed. In particular, an N-level shaper is analyzed. It modulates the source output bit rate on the basis of the buffer occupancy level. A very accurate analytical model describing its behavior is provided. Such a model allows an accurate description of the shaper output flow characteristics. A simple analytical model is also proposed for an ATM multiplexer in order to evaluate the advantages arising from the source shaping. The accuracy of the analytical results comes out from the comparison with the simulation ones. Numerical results show the effectiveness of the proposed shaping mechanism. They demonstrate that a substantial increase of the number of multiplexable sources is possible, for a given value of cell loss probability.<>
{"title":"Analysis of on-off source shaping for ATM multiplexing","authors":"F. Bernabei, L. Gratta, M. Listanti, A. Sarghini","doi":"10.1109/INFCOM.1993.253396","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253396","url":null,"abstract":"The multiplexing of shaped on-off sources on an asynchronous transfer mode (ATM) link is addressed. In particular, an N-level shaper is analyzed. It modulates the source output bit rate on the basis of the buffer occupancy level. A very accurate analytical model describing its behavior is provided. Such a model allows an accurate description of the shaper output flow characteristics. A simple analytical model is also proposed for an ATM multiplexer in order to evaluate the advantages arising from the source shaping. The accuracy of the analytical results comes out from the comparison with the simulation ones. Numerical results show the effectiveness of the proposed shaping mechanism. They demonstrate that a substantial increase of the number of multiplexable sources is possible, for a given value of cell loss probability.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253403
A. McAuley, P. Francis
The authors investigate fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those found in a national telephone network. The hierarchical addresses provide important benefits in large networks, but existing fast routing table lookup techniques, based on hardware such as content addressable memory (CAM), work only with flat addresses. Several fast routing table lookup solutions for hierarchical address based on binary and ternary CAMs are presented, and their advantages and drawbacks are analyzed.<>
{"title":"Fast routing table lookup using CAMs","authors":"A. McAuley, P. Francis","doi":"10.1109/INFCOM.1993.253403","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253403","url":null,"abstract":"The authors investigate fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those found in a national telephone network. The hierarchical addresses provide important benefits in large networks, but existing fast routing table lookup techniques, based on hardware such as content addressable memory (CAM), work only with flat addresses. Several fast routing table lookup solutions for hierarchical address based on binary and ternary CAMs are presented, and their advantages and drawbacks are analyzed.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116563900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253393
D. Nicol, R. Simha, D. Towsley
The authors consider the static load balancing problem of assigning several large tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have stochastically identical behavior. They show how the theory of majorization can be used to obtain a partial order among possible task assignment. The power of this approach may be summarized as follows: a simple comparison between assignments creates an ordering between them that holds for a variety of objective functions as well as for several statistics such as the mean and variance. This partial ordering is particularly useful when heterogeneous constraints are placed on the numbers of tasks that one may assign to the processors. The results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, it is shown how measurements of finishing time, resource utilization, and reliability are all captured by the theory.<>
{"title":"Load balancing of complex stochastic tasks using stochastic majorization","authors":"D. Nicol, R. Simha, D. Towsley","doi":"10.1109/INFCOM.1993.253393","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253393","url":null,"abstract":"The authors consider the static load balancing problem of assigning several large tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have stochastically identical behavior. They show how the theory of majorization can be used to obtain a partial order among possible task assignment. The power of this approach may be summarized as follows: a simple comparison between assignments creates an ordering between them that holds for a variety of objective functions as well as for several statistics such as the mean and variance. This partial ordering is particularly useful when heterogeneous constraints are placed on the numbers of tasks that one may assign to the processors. The results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, it is shown how measurements of finishing time, resource utilization, and reliability are all captured by the theory.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114904186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253270
A. Orda, R. Rom, N. Shimkin
A communication network shared by several selfish users is considered. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. The Nash equilibrium of such systems is investigated. For a two-node multiple-link system, the uniqueness of the Nash equilibrium is proved under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, the uniqueness of the Nash equilibrium is established under various assumptions.<>
{"title":"Competitive routing in multi-user communication networks","authors":"A. Orda, R. Rom, N. Shimkin","doi":"10.1109/INFCOM.1993.253270","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253270","url":null,"abstract":"A communication network shared by several selfish users is considered. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. The Nash equilibrium of such systems is investigated. For a two-node multiple-link system, the uniqueness of the Nash equilibrium is proved under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, the uniqueness of the Nash equilibrium is established under various assumptions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253267
W. C. Lee, M. Hluchyj, P. Humblet
Routing subject to multiple quality-of-service (QOS) constraints is considered. Such a problem arises in both private corporate backbone networks and public switched networks, and will become even more prevalent in the future with the emergence of asynchronous transfer mode (ATM) networks. A rule-based call-by-call source routing strategy that makes use of routing fallbacks to accommodate users with diverse QOS requirements is proposed.<>
{"title":"Rule-based call-by-call source routing for integrated communication networks","authors":"W. C. Lee, M. Hluchyj, P. Humblet","doi":"10.1109/INFCOM.1993.253267","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253267","url":null,"abstract":"Routing subject to multiple quality-of-service (QOS) constraints is considered. Such a problem arises in both private corporate backbone networks and public switched networks, and will become even more prevalent in the future with the emergence of asynchronous transfer mode (ATM) networks. A rule-based call-by-call source routing strategy that makes use of routing fallbacks to accommodate users with diverse QOS requirements is proposed.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121291822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253249
A. Ganz, B. Li
A cost-efficient metropolitan area network (MAN) based on a two-level structure is introduced. The physical topology of each level is a wavelength-division-multiplexing (WDM) passive star. The system design incorporates both the restrictions imposed by the unique features of the metropolitan environment, such as a relatively large number of nodes and large propagation delays, and the hardware limitations dictated by the WDM technology, such as a limited number of transceivers per node and the unavailability of wide-range rapidly tunable transceivers. A multicontrol channel-based protocol that is particularly suitable for packet switched communications is proposed. An analytical model is presented, and the system performance in terms of throughput and average delay is obtained.<>
{"title":"A packet-switched WDM passive optical star based metropolitan area network","authors":"A. Ganz, B. Li","doi":"10.1109/INFCOM.1993.253249","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253249","url":null,"abstract":"A cost-efficient metropolitan area network (MAN) based on a two-level structure is introduced. The physical topology of each level is a wavelength-division-multiplexing (WDM) passive star. The system design incorporates both the restrictions imposed by the unique features of the metropolitan environment, such as a relatively large number of nodes and large propagation delays, and the hardware limitations dictated by the WDM technology, such as a limited number of transceivers per node and the unavailability of wide-range rapidly tunable transceivers. A multicontrol channel-based protocol that is particularly suitable for packet switched communications is proposed. An analytical model is presented, and the system performance in terms of throughput and average delay is obtained.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123502339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253302
R. Krishnan, N. Maxemchuk
The performance and reliability comparison of two networks that have been proposed for use as high-speed metropolitan area networks (MANs)-the Manhattan street network (MS Net) and the distributed-queue dual-bus (DQDB) network-are compared. Both networks use slotted access protocols and have the same number of links, transmitters, and receivers per node. It is shown that the MS Net provides a much higher network throughput for a variety of traffic patterns, both uniform and nonuniform. It is shown that the MS Net can survive more failures than the DQDB network and that failures cause a lesser performance degradation in the MS Net. It is also shown that higher-level mechanisms are required in the DQDB network to recover from link failures, whereas deflection routing is sufficient in the MS Net.<>
{"title":"Is there life beyond linear topologies? A comparison of DQDB and the Manhattan street network","authors":"R. Krishnan, N. Maxemchuk","doi":"10.1109/INFCOM.1993.253302","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253302","url":null,"abstract":"The performance and reliability comparison of two networks that have been proposed for use as high-speed metropolitan area networks (MANs)-the Manhattan street network (MS Net) and the distributed-queue dual-bus (DQDB) network-are compared. Both networks use slotted access protocols and have the same number of links, transmitters, and receivers per node. It is shown that the MS Net provides a much higher network throughput for a variety of traffic patterns, both uniform and nonuniform. It is shown that the MS Net can survive more failures than the DQDB network and that failures cause a lesser performance degradation in the MS Net. It is also shown that higher-level mechanisms are required in the DQDB network to recover from link failures, whereas deflection routing is sufficient in the MS Net.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124058445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253272
S. Gianatti, A. Pattavina
The performance of multistage banyan networks with a shared buffer in each switching element is studied. Two different internal protocols are considered for the transfer of packets from stage to stage based on the presence or absence of interstage backpressure signals to signal the occurrence of buffer saturation conditions. As far as the offered traffic is concerned, two kinds of traffic patterns have been studied, a burst and an unbalanced traffic pattern. For both of them an analytical model is developed based on the iterative solution of state equations in order to compute the main traffic performance of the network.<>
{"title":"Performance analysis of shared-buffered banyan networks under arbitrary traffic patterns","authors":"S. Gianatti, A. Pattavina","doi":"10.1109/INFCOM.1993.253272","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253272","url":null,"abstract":"The performance of multistage banyan networks with a shared buffer in each switching element is studied. Two different internal protocols are considered for the transfer of packets from stage to stage based on the presence or absence of interstage backpressure signals to signal the occurrence of buffer saturation conditions. As far as the offered traffic is concerned, two kinds of traffic patterns have been studied, a burst and an unbalanced traffic pattern. For both of them an analytical model is developed based on the iterative solution of state equations in order to compute the main traffic performance of the network.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253260
I. Cidon, R. Guérin, A. Khamisy
Buffering policies that provide different loss priorities to packets/cells with no change in packet ordering (space priority disciplines) are studied. These policies are motivated by the possible presence, within the same connection, of packets with different loss probability requirements or guarantees. Examples of such applications are voice and video coders that generate information of unequal importance, and rate control mechanisms that mark excess traffic with a low priority rate violation tag. The focus is on the identification and evaluation of buffering policies that can guarantee performance, i.e. loss probability, to high priority packets irrespective of the traffic intensity and arrival patterns of low priority packets, while preserving the original ordering among packets. Such policies are termed protective policies.<>
{"title":"On protective buffer policies","authors":"I. Cidon, R. Guérin, A. Khamisy","doi":"10.1109/INFCOM.1993.253260","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253260","url":null,"abstract":"Buffering policies that provide different loss priorities to packets/cells with no change in packet ordering (space priority disciplines) are studied. These policies are motivated by the possible presence, within the same connection, of packets with different loss probability requirements or guarantees. Examples of such applications are voice and video coders that generate information of unequal importance, and rate control mechanisms that mark excess traffic with a low priority rate violation tag. The focus is on the identification and evaluation of buffering policies that can guarantee performance, i.e. loss probability, to high priority packets irrespective of the traffic intensity and arrival patterns of low priority packets, while preserving the original ordering among packets. Such policies are termed protective policies.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126565475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253351
K. Eng, M. Karol, R. Gitlin
The use of two resource-sharing techniques for congestion control in a backbone asynchronous transfer mode (ATM) network consisting of ATM cross-connects interconnected with high-speed optical links such as 2.4-Gb/s OC-48c fibers is studied. Memory sharing allows an optimal shared use of buffer space in an ATM switch fabric. Channel (or line) sharing, on the other hand, takes advantage of spare line capacity in the system to permit temporary increases in the output rates of the congested output ports. Fundamental bounds on delay-throughput performance and buffer requirements for specific cell loss rates are presented, and two practical application scenarios, representing line protection arrangements with and without service access capabilities, are introduced.<>
{"title":"Memory- and channel-sharing techniques for congestion control in ATM networks","authors":"K. Eng, M. Karol, R. Gitlin","doi":"10.1109/INFCOM.1993.253351","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253351","url":null,"abstract":"The use of two resource-sharing techniques for congestion control in a backbone asynchronous transfer mode (ATM) network consisting of ATM cross-connects interconnected with high-speed optical links such as 2.4-Gb/s OC-48c fibers is studied. Memory sharing allows an optimal shared use of buffer space in an ATM switch fabric. Channel (or line) sharing, on the other hand, takes advantage of spare line capacity in the system to permit temporary increases in the output rates of the congested output ports. Fundamental bounds on delay-throughput performance and buffer requirements for specific cell loss rates are presented, and two practical application scenarios, representing line protection arrangements with and without service access capabilities, are introduced.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：