Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253332
Chungki Lee, J. Burns, M. Ammar
The problem of collecting responses in multihop radio networks is considered. A given node is to collect a specified number of responses from nodes in a radio network. The problem arises in several applications of distributed systems. A deterministic protocol and a randomized protocol for the problem are presented. The two protocols are analyzed and their performances are compared.<>
{"title":"Protocols for collecting responses in multi-hop radio networks","authors":"Chungki Lee, J. Burns, M. Ammar","doi":"10.1109/INFCOM.1993.253332","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253332","url":null,"abstract":"The problem of collecting responses in multihop radio networks is considered. A given node is to collect a specified number of responses from nodes in a radio network. The problem arises in several applications of distributed systems. A deterministic protocol and a randomized protocol for the problem are presented. The two protocols are analyzed and their performances are compared.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"7 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":"115745963","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.253345
R. Krishnan, J. Silvester
Multipath source routing schemes can be distinguished by their choice of allocation granularity. The schemes proposed in the literature advocate a per-connection allocation wherein all the packets of a connection are constrained to follow the same path. The authors believe that a smaller allocation granularity permits a finer control to be exerted and would result in improved performance, especially in the presence of bursty traffic sources. A simple two-node network is used to compare the performance of both allocation schemes. An analytical model is developed to compute the resequencing delay distribution for the per-packet allocation. It is observed that as the burstiness of the arrival process increases, the per-packet allocation is able to accommodate bursts in a more graceful fashion, resulting in better performance. The per-packet allocation also permits a more equitable distribution of network resources than the per-connection.<>
{"title":"Choice of allocation granularity in multipath source routing schemes","authors":"R. Krishnan, J. Silvester","doi":"10.1109/INFCOM.1993.253345","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253345","url":null,"abstract":"Multipath source routing schemes can be distinguished by their choice of allocation granularity. The schemes proposed in the literature advocate a per-connection allocation wherein all the packets of a connection are constrained to follow the same path. The authors believe that a smaller allocation granularity permits a finer control to be exerted and would result in improved performance, especially in the presence of bursty traffic sources. A simple two-node network is used to compare the performance of both allocation schemes. An analytical model is developed to compute the resequencing delay distribution for the per-packet allocation. It is observed that as the burstiness of the arrival process increases, the per-packet allocation is able to accommodate bursts in a more graceful fashion, resulting in better performance. The per-packet allocation also permits a more equitable distribution of network resources than the per-connection.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"7 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":"125331167","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.253235
M. Marsan, S. Donatelli, F. Neri, U. Rubino
Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<>
{"title":"Good and bad dynamic polling orders in symmetric single buffer Markovian multiserver multiqueue systems","authors":"M. Marsan, S. Donatelli, F. Neri, U. Rubino","doi":"10.1109/INFCOM.1993.253235","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253235","url":null,"abstract":"Generalized stochastic Petri nets (GSPNs) are used to study the performances of several dynamic polling orders in symmetric multiserver multiqueue systems with one-buffer queues and Markovian interarrival, service, and walk times. Exact numerical results are obtained by means of Great-SPN, a software tool for the analysis of GSPNs, and are presented as curves of the average customer delay and waiting time. The results quantify the performance differences among the various polling orders, and show that the usual cyclic order can be the most effective, if the possibility of shorter walk times in the cyclic cases is adequately taken into account.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"44 7 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":"125685323","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.253377
M. Nguyen, M. Schwartz
The authors examine the data transfer phase of TCP (Transmission Control Protocol) to identify complex processing elements, where complexity is measured in terms of instruction counts. The objective is to reduce the complexity and improve the performance of TCP in a high speed networking environment, especially for bulk data transfer. It is found that most of the complexity is due to incomplete state information exchange with the peer, and to adapting to network dynamics using the current congestion control scheme. By partitioning of the protocol functionality into data and control information processing, along with the use of a rate based congestion control scheme, the complexity can be reduced by up to 67%. Performance can be further enhanced by running the new properly partitioned TCP in parallel as well as by simplifying the logic associated with some TCP timers.<>
{"title":"Reducing the complexities of TCP for a high speed networking environment","authors":"M. Nguyen, M. Schwartz","doi":"10.1109/INFCOM.1993.253377","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253377","url":null,"abstract":"The authors examine the data transfer phase of TCP (Transmission Control Protocol) to identify complex processing elements, where complexity is measured in terms of instruction counts. The objective is to reduce the complexity and improve the performance of TCP in a high speed networking environment, especially for bulk data transfer. It is found that most of the complexity is due to incomplete state information exchange with the peer, and to adapting to network dynamics using the current congestion control scheme. By partitioning of the protocol functionality into data and control information processing, along with the use of a rate based congestion control scheme, the complexity can be reduced by up to 67%. Performance can be further enhanced by running the new properly partitioned TCP in parallel as well as by simplifying the logic associated with some TCP timers.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"73 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":"123836526","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.253352
A. Elwalid, D. Mitra
A prime instrument for controlling congestion in high-speed broadband ISDN (BISDN) networks is admission control, which limits call and guarantees a grade of service determined by delay and loss probability in the multiplexer. It is shown, for general Markovian traffic sources, that it is possible to assign a notational effective bandwidth to each source which is an explicitly identified, simply computing quantity with provably correct properties in the natural asymptotic regime of small loss probabilities. It is the maximal real eigenvalue of a matrix which is directly obtained from the source characteristics and the admission criterion, and for several sources it is simply additive. Both fluid and point process models are considered, and parallel results are obtained. Numerical results show that the acceptance set for heterogeneous classes of sources is closely approximated and conservatively bounded by the set obtained from the effective bandwidth approximation.<>
{"title":"Effective bandwidth of general Markovian traffic sources and admission control of high speed networks","authors":"A. Elwalid, D. Mitra","doi":"10.1109/INFCOM.1993.253352","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253352","url":null,"abstract":"A prime instrument for controlling congestion in high-speed broadband ISDN (BISDN) networks is admission control, which limits call and guarantees a grade of service determined by delay and loss probability in the multiplexer. It is shown, for general Markovian traffic sources, that it is possible to assign a notational effective bandwidth to each source which is an explicitly identified, simply computing quantity with provably correct properties in the natural asymptotic regime of small loss probabilities. It is the maximal real eigenvalue of a matrix which is directly obtained from the source characteristics and the admission criterion, and for several sources it is simply additive. Both fluid and point process models are considered, and parallel results are obtained. Numerical results show that the acceptance set for heterogeneous classes of sources is closely approximated and conservatively bounded by the set obtained from the effective bandwidth approximation.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"102 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":"124207715","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.253336
K. Sohraby
A general theory of on-off sources is provided. The basic source model is characterized by alternating independent on (burst) and off (silence) periods, which may have general distributions. Other more complex sources are constructed, and their behavior is characterized in terms of the basic source model. Heterogeneous and homogeneous statistical multiplexers fed by such sources are considered. In the heterogeneous environment, a simple result on the tail behavior of the multiplexer queue length distribution in the heavy traffic is provided. In the homogeneous environment, asymptotic results on the tail behavior of the queue length distribution are provided for all levels of utilization. The results for the heterogeneous environment suggest a new call admission control policy for general on-off sources in high-speed networks, which depends only on the first two moments of the on and off periods of individual sources and their respective peak rates.<>
{"title":"On the theory of general on-off sources with applications in high-speed networks","authors":"K. Sohraby","doi":"10.1109/INFCOM.1993.253336","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253336","url":null,"abstract":"A general theory of on-off sources is provided. The basic source model is characterized by alternating independent on (burst) and off (silence) periods, which may have general distributions. Other more complex sources are constructed, and their behavior is characterized in terms of the basic source model. Heterogeneous and homogeneous statistical multiplexers fed by such sources are considered. In the heterogeneous environment, a simple result on the tail behavior of the multiplexer queue length distribution in the heavy traffic is provided. In the homogeneous environment, asymptotic results on the tail behavior of the queue length distribution are provided for all levels of utilization. The results for the heterogeneous environment suggest a new call admission control policy for general on-off sources in high-speed networks, which depends only on the first two moments of the on and off periods of individual sources and their respective peak rates.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"28 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":"123723411","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.253287
Sanjay Gupta, M. Zarki
An asynchronous transfer mode (ATM) switch mode at which cell arrive from a diverse set of source types is considered. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Cells belonging to different traffic classes are transported by separate virtual paths though the network. Approximations for the quality of service that should be maintained for each traffic class are developed. Approximations are then developed for estimating the bandwidth and buffer requirements of each traffic class and also for the switch node. The problem of assigning weights, given a set of traffic classes, is addressed. The set of traffic classes that require the least amount of resources is determined. The closely related problem of minimizing the number of traffic classes given a finite bandwidth is also discussed. The structure of the problem at hand is then exploited to develop an efficient heuristic.<>
{"title":"Traffic classification for round-robin scheduling schemes in ATM networks","authors":"Sanjay Gupta, M. Zarki","doi":"10.1109/INFCOM.1993.253287","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253287","url":null,"abstract":"An asynchronous transfer mode (ATM) switch mode at which cell arrive from a diverse set of source types is considered. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Cells belonging to different traffic classes are transported by separate virtual paths though the network. Approximations for the quality of service that should be maintained for each traffic class are developed. Approximations are then developed for estimating the bandwidth and buffer requirements of each traffic class and also for the switch node. The problem of assigning weights, given a set of traffic classes, is addressed. The set of traffic classes that require the least amount of resources is determined. The closely related problem of minimizing the number of traffic classes given a finite bandwidth is also discussed. The structure of the problem at hand is then exploited to develop an efficient heuristic.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"96 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":"115682247","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.253383
Zhensheng Zhang, Yow-Jong Liu
The performance of a direct-sequence/code-division multiple-access (DS CDMA) spreading ALOHA access protocol, which can be applied to wireless data network and personal communications services, is investigated. A Markov model is used to derive upper and lower bounds of the throughput of the underlying system. Time-driven simulation is also performed to investigate the tightness of the bounds. The results indicate that the upper bound is very tight. Numerical results also show that, unlike the conventional ALOHA system, the DS/CDMA spreading mainslotted ALOHA system provides better delay and throughput performance than the DS/CDMA spreading-slotted ALOHA system.<>
{"title":"Performance analysis of multiple access protocols for CDMA cellular and personal communications services","authors":"Zhensheng Zhang, Yow-Jong Liu","doi":"10.1109/INFCOM.1993.253383","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253383","url":null,"abstract":"The performance of a direct-sequence/code-division multiple-access (DS CDMA) spreading ALOHA access protocol, which can be applied to wireless data network and personal communications services, is investigated. A Markov model is used to derive upper and lower bounds of the throughput of the underlying system. Time-driven simulation is also performed to investigate the tightness of the bounds. The results indicate that the upper bound is very tight. Numerical results also show that, unlike the conventional ALOHA system, the DS/CDMA spreading mainslotted ALOHA system provides better delay and throughput performance than the DS/CDMA spreading-slotted ALOHA system.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"34 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":"122699458","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.253390
Jonathan L. Wang
The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<>
{"title":"A novel link set dimensioning procedure for networks supporting the load splitting link selection algorithm","authors":"Jonathan L. Wang","doi":"10.1109/INFCOM.1993.253390","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253390","url":null,"abstract":"The load splitting link selection algorithm used in the Common Channel Signaling (CCS) network and proposed for use in the interswitching system interface in the network supporting the Switched Multimegabit Data Service (SMDS) is considered. The algorithm uses a randomly generated bit pattern to select a link for transmission. The author discusses how the traffic loads are distributed among the links in a link set based on the load splitting link selection algorithm and shows that, in some cases, the overall traffic capacity of the link set does not increase even when the number of installed links increases. A theorem that shows how to construct the set of links to increase the line set capacity is demonstrated. The theorem is used as the basis for an efficient and flexible procedure for implementing the link dimensioning algorithm in software, to support the mechanization of the CCS and SMDS network planning and traffic engineering functions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"29 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":"122948427","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.253296
Y. Yemini, D. Florissi
An overview is given of a switching architecture for high-speed networks called Isochronets, which time-divide network bandwidth among routing trees. Traffic moves down a routing tree to the root during its time band. Network functions such as routing and flow control are entirely governed by band timers and require no processing of frame header bits. Frame motions need not be delayed for switch processing, allowing Isochronets to scale over a large spectrum of transmission speeds and support all-optical implementations. The network functions as a media-access layer that can support multiple framing protocols simultaneously, handled by higher layers at the periphery. Internetworking is reduced to a simple media-layer bridging. Isochronets provide flexible quality of service control and multicasting though allocation of bands to routing trees. They can be tuned to span a spectrum of performance behaviors outperforming both circuit and packet switching.<>
{"title":"Isochronets: a high-speed network switching architecture","authors":"Y. Yemini, D. Florissi","doi":"10.1109/INFCOM.1993.253296","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253296","url":null,"abstract":"An overview is given of a switching architecture for high-speed networks called Isochronets, which time-divide network bandwidth among routing trees. Traffic moves down a routing tree to the root during its time band. Network functions such as routing and flow control are entirely governed by band timers and require no processing of frame header bits. Frame motions need not be delayed for switch processing, allowing Isochronets to scale over a large spectrum of transmission speeds and support all-optical implementations. The network functions as a media-access layer that can support multiple framing protocols simultaneously, handled by higher layers at the periphery. Internetworking is reduced to a simple media-layer bridging. Isochronets provide flexible quality of service control and multicasting though allocation of bands to routing trees. They can be tuned to span a spectrum of performance behaviors outperforming both circuit and packet switching.<<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":"123619961","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
扫码关注我们
求助内容：
应助结果提醒方式：