Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95最新文献

筛选
英文 中文
Adaptive CACs using Bayesian performance estimation 使用贝叶斯性能估计的自适应cac
H. Saito
{"title":"Adaptive CACs using Bayesian performance estimation","authors":"H. Saito","doi":"10.1109/ICCCN.1995.540096","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540096","url":null,"abstract":"A typical example of telecommunication system performance estimation during operation is connection admission control (CAC) of asynchronous transfer mode (ATM) networks. This paper investigates adaptive CACs using Bayesian performance estimation. The performance is estimated through Bayesian regression analysis, in which the monitored performance and an a priori estimate are given by conventional techniques such as queueing theory and simulation. Three adaptive CACs are studied: a CA C based on a log-transform of the cell loss ratio (CLR), a CAC based on a maximum queue length during a fixed period, and a CAC based on CLR. Numerical examples show the following results: oscillation of VCs in a VP may occur and may be worse when the measurement period is longer; initial variance is important for accurate estimation; CACs using CLR and the log-transform of CLR can not easily assure the CLR objective; the CAC using the maximum queue size performs well and has rapid convergence; the monitored performance data improves the estimates even when the performance is monitored with different conditions than the target condition.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117031582","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}
引用次数: 3
Real-time computation of empirical autocorrelation, and detection of non-stationary traffic conditions in high-speed networks 高速网络中经验自相关的实时计算与非平稳交通状态的检测
A. Bragg, W. Chou
{"title":"Real-time computation of empirical autocorrelation, and detection of non-stationary traffic conditions in high-speed networks","authors":"A. Bragg, W. Chou","doi":"10.1109/ICCCN.1995.540121","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540121","url":null,"abstract":"Stochastic traffic processes are open nonstationary (dynamic, transient), yet naive assumptions about stationarity lead to unrealistic forecasts. Format tests for stationarity are impractical in real time, and some heuristic tests are imprecise. Lagged autocorrelations are used in time series analysis for empirical stationarity tests, model identification and forecasting, but traditional methods are too slow for sub-second computation of empirical autocorrelation functions. We describe a mechanism for computing the empirical lag autocorrelation function of time series {X/sub i/} in real time, and for using this function to detect nonstationarity conditions. Fuzzy logic is used to design a fast and accurate neural classifier of stationarity, The classifier's estimate is updated with each new observation. No passes through sample datasets are necessary, and there is no need to overly compensate for round-off error. A real-time classifier of stationarity is fundamental to any sub-second traffic forecasting mechanism.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116729166","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
Approximating the FDDI synchronous mode 近似FDDI同步模式
D. Etherton, Michael M. Johnson, George C. Polyzos
{"title":"Approximating the FDDI synchronous mode","authors":"D. Etherton, Michael M. Johnson, George C. Polyzos","doi":"10.1109/ICCCN.1995.540167","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540167","url":null,"abstract":"We present protocol extensions supporting real-time traffic performance guarantees for Fiber Distributed Data Interface (FDDI) implementations lacking a synchronous mode of operation. We provide a brief description of the FDDI protocol, with an emphasis on the synchronous mode and network parameter tuning to meet real-time application demands, and then discuss hardware limitations of some first-generation FDDI adapters which make the synchronous node ineffective and unable to support the required performance guarantees. By modifying the operating system kernel we can regulate the flow of information to the FDDI adapters and implement guarantees in higher-level software. Specifically, we added a two-tiered regulation facility which, at the lowest level, would place an upper bound on asynchronous transmission rate from the device driver buffers to the adapter. The next level up added the notion of standard and guaranteed performance system queues which user-level traffic could be directed into. Finally, a distributed user-level software mechanism was added to monitor and appropriately regulate the throughput from each adapter on the LAN in response to varying bandwidth requirements.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927647","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}
引用次数: 0
Data sharing and recovery in gigabit-networked databases 千兆网络数据库中的数据共享和恢复
S. Banerjee, Panos K. Chrysanthis
{"title":"Data sharing and recovery in gigabit-networked databases","authors":"S. Banerjee, Panos K. Chrysanthis","doi":"10.1109/ICCCN.1995.540120","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540120","url":null,"abstract":"Major advances in optical fiber transmission and switching technology have enabled the development of very high speed networks with data rates of the order of gigabits per second. It is anticipated that in the future, wide area gigabit networks will interconnect database servers around the globe creating extremely powerful distributed information systems. In this paper, we examine the implications of such a high speed network on data access and sharing techniques and propose a lock-based concurrency control protocol and a log-based recovery protocol that ensures data consistency in gigabit-networked databases. Both protocols exploit the characteristics of a gigabit network to enhance the performance of the database system and, in particular, the fact that the size of the message is less of a concern than the number of sequential phases of message passing.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957751","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}
引用次数: 17
A queueing model for wormhole routing with timeout 带超时的虫洞路由的排队模型
Po-Chi Hu, L. Kleinrock
{"title":"A queueing model for wormhole routing with timeout","authors":"Po-Chi Hu, L. Kleinrock","doi":"10.1109/ICCCN.1995.540177","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540177","url":null,"abstract":"In this paper, we propose an analytical model for wormhole routing with the use of a timeout reset mechanism. This model is based on an M/G/1 queueing system with impatient customers and feedback. Some approximations are proposed and verified by simulation. By comparing our analytical results to simulation, we show that the proposed model successfully captures the performance characteristics of wormhole routing with a timeout reset mechanism.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114358368","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}
引用次数: 25
Unicast, multicast, and broadcast in enhanced Fibonacci cubes 单播,多播和广播在增强的斐波那契立方体
Haifeng Qian, Jie Wu
{"title":"Unicast, multicast, and broadcast in enhanced Fibonacci cubes","authors":"Haifeng Qian, Jie Wu","doi":"10.1109/ICCCN.1995.540114","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540114","url":null,"abstract":"The enhanced Fibonacci cube (EFC) is defined based on the sequence F/sub n/=2F/sub n-2/+2F/sub n-4/. It contains the Fibonacci cube as a subgraph and maintains virtually all the desirable properties of the Fibonacci cube, and it also possesses properties such as the Hamiltonian property that the Fibonacci cube does not have. In this paper, we study data routing, namely, unicast, multicast and broadcast in the enhanced Fibonacci cube. The time and traffic steps are used to measure the efficiency of the routing algorithms. The unicast algorithm, which uses a Hamming distance path for any two nodes in EFC, is time and traffic optimal. The broadcast algorithm which employs the enhanced Fibonacci tree is traffic optimal and near time optimal. Two heuristic multicast algorithms are proposed which are based on an enhanced Fibonacci tree and a Hamiltonian cycle, respectively.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583045","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}
引用次数: 3
Phasing ATM technology into an IP environment 逐步将ATM技术引入IP环境
Y. Rekhter, D. Kandlur
{"title":"Phasing ATM technology into an IP environment","authors":"Y. Rekhter, D. Kandlur","doi":"10.1109/ICCCN.1995.540164","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540164","url":null,"abstract":"We examine two key aspects of the ATM deployment in the TCP/IP environment-logical IP sub-networks (LISs) and address mapping servers, with a specific emphasis on how different alternatives for LISs and address mapping servers enable efficient exploration of all the capabilities that ATM promises to deliver. We propose an approach for ATM deployment in the TCP/IP environment that leverages the existing technologies (e.g. DNS, routing protocols), minimizes new development, imposes no new requirements on ATM, allows for small, incremental changes with immediate payoffs, while at the same time retains backward compatibility with the existing schemes, such as LAN Emulation and \"classical\" IP over ATM. The proposed approach combines a switch-based infrastructure with router-based overlay and uses each for that which it is best suited: switch-based infrastructure for applications that can justify an SVC establishment; router-based overlay for all other applications.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126749301","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
Object-oriented modelling of communication protocols for re-use 用于重用的通信协议的面向对象建模
A. A. Hanish, T. Dillon
{"title":"Object-oriented modelling of communication protocols for re-use","authors":"A. A. Hanish, T. Dillon","doi":"10.1109/ICCCN.1995.540097","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540097","url":null,"abstract":"The main motivation for the present work stems from the wide gap which exists between the research efforts devoted to developing formal descriptions for communication protocols and the effective development methodologies used in industrial implementations. We apply object-oriented (OO) modelling principles to networking protocols, exploring the potential for producing re-useable software modules by discovering the generic underlying class structures and behaviour. Petri nets (PNs) are used for deriving re-useable model elements and the slightly modified TTCN notation is used for message sequence encoding. This demonstrates a formal, practical approach to the development of a protocol implementation through OO modelling. The paper addresses the problem of inter-layer communication among multiple protocol entities (PEs), assuming the standard ISO/OSI Reference Model. A generalised model called the inter-layer communication (ILC) model is proposed. An example of a PE based on the alternating-bit protocol (ABP) is also discussed.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"921 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114058020","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
Performance analysis of PCS mobility management database system PCS移动管理数据库系统性能分析
X. Qiu, V. Li
{"title":"Performance analysis of PCS mobility management database system","authors":"X. Qiu, V. Li","doi":"10.1109/ICCCN.1995.540156","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540156","url":null,"abstract":"A queueing model is developed for the database system which supports mobility management in personal communication systems (PCS). The end-to-end service delay is defined as the performance metric. The accuracy of the analytical model is validated by simulation. It is found that the analytical results show a close agreement to those from simulation over a significant range of system parameters. Three database system architectures proposed for PCS are studied, namely, the flat database system in GSM, the two-level hierarchical architecture, and the three-level hierarchical architecture. Based on the queueing model, the delay performance of these three architectures are compared. It is observed that the hierarchical architecture provides the best system performance and supports the highest user density. This is because the service arrival rate to the higher level large database is significantly reduced, due to the localized nature of calls and users in PCS.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115560121","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}
引用次数: 23
Multicasting in ATM networks using MINs 使用MINs的ATM网络中的组播
S. Subramaniam, Arun Kumar Somani
{"title":"Multicasting in ATM networks using MINs","authors":"S. Subramaniam, Arun Kumar Somani","doi":"10.1109/ICCCN.1995.540112","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540112","url":null,"abstract":"In this paper, we discuss the problem of establishing multicast connections using self-routing multistage interconnection networks (MINs). We examine the issue of multicasting and propose various schemes to accomplish it. Multicasting using recycling of cells has been suggested in the literature recently. We propose a multicast switch architecture that requires a few simple enhancements over a MIN and describe the process of setting up a multicast connection. The size of the routing tables limit the number of copies per cell that can be generated per pass through the network. We assume that no more than two copies per cell can be generated per pass through the routing network and provide detailed cell-level simulation results for the average delay of a cell. The results show that recycling is a practicable option for multicasting and that the delay does not increase drastically when cells are recycled.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127365542","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书