Proceedings of LCN - 21st Annual Conference on Local Computer Networks最新文献

筛选
英文 中文
An enhanced timed-round-robin traffic control scheme for ATM networks 一种针对ATM网络的增强定时轮循流量控制方案
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558153
Q. Zheng
{"title":"An enhanced timed-round-robin traffic control scheme for ATM networks","authors":"Q. Zheng","doi":"10.1109/LCN.1996.558153","DOIUrl":"https://doi.org/10.1109/LCN.1996.558153","url":null,"abstract":"ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. Achievement of this goal is vital to make ATM an enabling technology for the future integrated digital networks. This paper presents a traffic control scheme which uses a timed-round-robin cell transmission scheduling algorithm enhanced with a simple feedback flow control mechanism to realize the promised advantages of ATM networks. Specifically, with the proposed scheme, a network is able to provide each user with (1) a guaranteed bandwidth, (2) immediate access to the full link bandwidth when there is no contention from other users, and (3) freedom from cell losses. An ATM switch design is also presented which shows the feasibility of implementing the proposed scheme with today's switch architectures.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125178696","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}
引用次数: 4
A strategy for construction of a 40 Mbps bundle of MPEG VBR bit streams 构建40mbps MPEG VBR位流束的策略
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558160
S. G. Chang, D. Suh, M. Kyung, S. Park, Jae-il Jung
{"title":"A strategy for construction of a 40 Mbps bundle of MPEG VBR bit streams","authors":"S. G. Chang, D. Suh, M. Kyung, S. Park, Jae-il Jung","doi":"10.1109/LCN.1996.558160","DOIUrl":"https://doi.org/10.1109/LCN.1996.558160","url":null,"abstract":"We propose a strategy to increase the number of VBR MPEG video bit streams multiplexed into a channel limited in bandwidth. We note that by reducing the number of overlapping intra-frames, bit rate fluctuation in the multiplexed bit stream is notably decreased. This strategy is applied to single layer bit streams and a strategy for double layer video bit streams is discussed. The performance of our proposal is demonstrated by static and dynamic analysis, including power spectrum density and queueing analysis. We propose methods to calculate the statistical multiplexing gain, which are based on both delay and loss QoS requirements at the same time. Previous definitions of muitiplexing gain are compared to ours.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814416","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}
引用次数: 1
A fuzzy policing mechanism for still picture in ATM networks ATM网络中静态图像的模糊监管机制
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558129
L. Barolli, K. Tanno
{"title":"A fuzzy policing mechanism for still picture in ATM networks","authors":"L. Barolli, K. Tanno","doi":"10.1109/LCN.1996.558129","DOIUrl":"https://doi.org/10.1109/LCN.1996.558129","url":null,"abstract":"The asynchronous transfer mode (ATM) technique has been accepted as a basis for the future B-ISDN networks. In ATM networks, all information is packetized and transferred in small packets of fixed length, called cells. The packetized information transfer, without flow control between the user and the network and the use of statistical multiplexing, results in the need of a policing mechanism to control the traffic parameters of each virtual connection in order to guarantee the required quality of service (QoS). The proposed parameters for monitoring the source traffic characteristics are the mean cell rate, the peak cell rate or the peak burst duration. Policing of the peak cell rate is generally not complex and can be achieved by using a cell spacer or other policing mechanisms (PMs). Monitoring the mean cell rate is more difficult. It is intended to improve the link utilization when it has to handle bursty traffic sources. We propose a policing mechanism called the fuzzy policing mechanism (FPM), by applying fuzzy set theory to police the mean cell rate of the still picture source in ATM networks. The performance evaluation via simulation shows that the FPM efficiently control the mean cell rate of the still picture source. The proposed FPM shows a good response behavior against parameter variations. The selectivity characteristics of the FPM approach the ideal characteristics required for a PM.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560678","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}
引用次数: 2
Mobility modeling in cellular communication networks 蜂窝通信网络中的移动性建模
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558182
P. Camarda, G. Schiraldi, F. Talucci
{"title":"Mobility modeling in cellular communication networks","authors":"P. Camarda, G. Schiraldi, F. Talucci","doi":"10.1109/LCN.1996.558182","DOIUrl":"https://doi.org/10.1109/LCN.1996.558182","url":null,"abstract":"We develop a simple and general analytical model for cellular communication networks performance evaluation. The model assumes a finite population of mobiles moving in a finite set of cells. Such a model allows one to evaluate the effects, on system performance, of the following factors: fixed channel allocation (FCA) criteria, load of the users, mobility and distribution of users among cells. The numerical simulation shows that the results of this simple model are acceptable in a wide range of mobility and from light to moderate load conditions. It is pointed out that some of the parameters, that is, the blocking probability of a new call and hand-off blocking probability, are almost invariant with mobility, while forced termination probability and unsuccessful probability do depend on mobility.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126789730","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}
引用次数: 6
A novel intra-media synchronization mechanism for multimedia communications 一种新的多媒体通信媒体内同步机制
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558133
M. Yuang, P. Tien
{"title":"A novel intra-media synchronization mechanism for multimedia communications","authors":"M. Yuang, P. Tien","doi":"10.1109/LCN.1996.558133","DOIUrl":"https://doi.org/10.1109/LCN.1996.558133","url":null,"abstract":"Multimedia communications often require intra-media synchronization for video data to prevent potential playout discontinuity resulting from network delay variation (jitter) while still achieving satisfactory playout throughput. We propose a neural-network-based intra-media synchronization mechanism, called neural network smoother (NNS). The NNS is composed of a neural network (NN) traffic predictor, an NN window determinator, and a window-based playout smoothing algorithm. The NN traffic predictor employs an on-line-trained backpropagation neural network (BPNN) to periodically predict future traffic characteristics. With the predicted traffic characteristics, the NN window determinator determines the corresponding optimal window by means of an off-line-trained BPNN in an effort to achieve a maximum of the playout quality (Q) value. The window-based playout smoothing algorithm then dynamically adopts various playout rates according to the window and the number of packets in the buffer. Compared to two other playout approaches, simulation results show that NNS achieves high-throughput and low-discontinuity playout under a variety of traffic arrivals.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000879","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}
引用次数: 1
Performance analysis of ATM switches with multistage packet switching interconnection networks 多级分组交换互联ATM交换机性能分析
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558136
A. Tentov, A. Grnarov
{"title":"Performance analysis of ATM switches with multistage packet switching interconnection networks","authors":"A. Tentov, A. Grnarov","doi":"10.1109/LCN.1996.558136","DOIUrl":"https://doi.org/10.1109/LCN.1996.558136","url":null,"abstract":"A mathematical method for analysis of ATM switches based on multistage packet switching interconnection networks with finite buffering capacity at the output of switching elements is presented. The proposed mathematical method is general in that it analyzed ATM switches under uniform and nonuniform traffic with blocking. The existing methods for analysis of ATM switches with buffered interconnection networks, have assumed either single or infinite buffers at each input (or output) port of a switch, as well as uniform traffic pattern of the networks. Firstly in the paper a general model of a synchronous buffered switching element, using output buffering, under the assumption of finite buffer size for a very general class of traffic patterns, is presented. It is assumed that the subsequent stages of the network are nearly independent and a model is extended for an entire network under this assumption. Analytical results obtained with the proposed model are then compared with each other and it is shown that the proposed mathematical method is more general than the known models.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109802","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}
引用次数: 2
Back-pressure buffering scheme to improve the cell loss property on the output buffered ATM switch 采用背压缓冲方案改善输出缓冲ATM交换机的小区损耗特性
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558152
Keunbae Kim, Hyup-Jong Kim
{"title":"Back-pressure buffering scheme to improve the cell loss property on the output buffered ATM switch","authors":"Keunbae Kim, Hyup-Jong Kim","doi":"10.1109/LCN.1996.558152","DOIUrl":"https://doi.org/10.1109/LCN.1996.558152","url":null,"abstract":"We have studied back-pressure buffering mechanisms to improve the cell loss property in output buffered ATM switches. In order to minimize the cell loss in an output buffer, the back-pressure buffering mechanism pressures the transmission of input cells to the switch fabric according to the load status of the output buffer. We have studied and proposed two back-pressure buffering mechanisms; one is the push-out mechanism with a single FIFO and the other is the selective pressure mechanism with a shared memory. The main subjects of this study were: (1) a performance comparison using computer simulation between a system without back-pressure buffering and a system with the proposed back-pressure schemes and (2) a proposal for a practical implementation structure. Through the simulation results, we conclude that a pure push-out mechanism cannot improve the performance but a selective pressure mechanism will provide enormous improvement of the cell loss property with a small sized memory.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395230","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}
引用次数: 5
A proposal of flow control mechanism for multicast ABR and its performance 提出了一种组播ABR流量控制机制及其性能
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558146
T. Yokotani, T. Ichihashi
{"title":"A proposal of flow control mechanism for multicast ABR and its performance","authors":"T. Yokotani, T. Ichihashi","doi":"10.1109/LCN.1996.558146","DOIUrl":"https://doi.org/10.1109/LCN.1996.558146","url":null,"abstract":"One of the functions that should be provided in ATM LANs is multicast communication. For multicast communication on ATM LANs, the architecture of the switch fabric and protocols for signaling have been studied. However, when data communication using a multicast connection such as a LAN emulation service which expects the high throughput is provided, ABR (available bit rate) service on a multicast connection (multicast ABR) is also required. ABR service has been actively discussed in the ATM Forum. Unfortunately, the study on flow control mechanism for multicast ABR is not sufficient. This paper discusses a suitable flow control mechanism for multicast ABR and shows its performance. At first, it summarizes the approaches for the flow control and describes the outline of the proposed mechanism based on the suitable approach. Next it evaluates the performance and shows the effectiveness of the mechanism by simulations. Moreover, after pointing out the importance of operations in the case of link failures on the multicast tree, it discusses the cooperation in this case between the flow control and the related functions to detect these failures.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121874534","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}
引用次数: 1
GSN: a new multihop architecture for optical networks GSN:一种新的光网络多跳架构
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558179
A. Abbinante, P. Camarda
{"title":"GSN: a new multihop architecture for optical networks","authors":"A. Abbinante, P. Camarda","doi":"10.1109/LCN.1996.558179","DOIUrl":"https://doi.org/10.1109/LCN.1996.558179","url":null,"abstract":"The main target of this paper is to define and study new multihop architectures capable, potentially of supporting a sustained throughput per user in the order of a Gigabit per second. The Generalized ShuffleNet (GSN) virtual topology is presented and its main characteristics explored, highlighting modularity and rearrangeability. In particular necessary conditions for rearrangeability have been derived analytically, while the sufficiency has been verified, for particular cases, by a computer program. Moreover a novel, table free, routing scheme ensures high performances by distributed hardware based decisions.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133466673","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}
引用次数: 1
Analysis and optimization of a Banyan based ATM switch by simulations 基于Banyan的ATM交换机的仿真分析与优化
Proceedings of LCN - 21st Annual Conference on Local Computer Networks Pub Date : 1996-10-31 DOI: 10.1109/LCN.1996.558155
S. Hussain, Y. Jenq
{"title":"Analysis and optimization of a Banyan based ATM switch by simulations","authors":"S. Hussain, Y. Jenq","doi":"10.1109/LCN.1996.558155","DOIUrl":"https://doi.org/10.1109/LCN.1996.558155","url":null,"abstract":"The main concern in designing the switching fabrics used in asynchronous transfer mode (ATM) technology are speed, throughput, delay and variance of delay for a given bandwidth. We analyze the performance by simulations of ATM switch based on Banyan network in the uniform traffic condition. We compare the analytical results obtained from the three-state model by Yan and Jenq (see MS Thesis, Dept. of Electrical and Computer Engineering, Portland State University, Portland, Oregon, 1995) to the simulation results. We propose non-blocking first stage (NBFS) to increase the throughput. In the NBFS scheme, internal blocking in the switching element (SE) of the first stage is avoided. We extend the idea of the priority scheme proposed by Yan and Jenq by proposing an enhanced priority (EP) scheme. In the EP scheme, we give priority to the packet blocked the greater number of times. We simulated the switch with a combined NBFS and EP scheme. The results shows that the throughput increases, and the variance of delay decreases significantly. We simulated the single buffer Banyan network with mixed voice and data traffic We simulated the Banyan network with the proposed double buffer switching element to increase the throughput and decrease the delay and variance of delay, of delay sensitive voice packet in a mixed traffic condition.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133935280","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}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信