发布求助
文献互助 智能选刊 最新文献

IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings最新文献

筛选
英文 中文
Translation of QoS parameters into ATM performance parameters in B-ISDN B-ISDN中QoS参数到ATM性能参数的转换
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1996-08-01 DOI: 10.1109/INFCOM.1993.253295
Jae-il Jung, D. Seret
{"title":"Translation of QoS parameters into ATM performance parameters in B-ISDN","authors":"Jae-il Jung, D. Seret","doi":"10.1109/INFCOM.1993.253295","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253295","url":null,"abstract":"The quality of service (QoS) concept for broadband ISDN (B-ISN) is studied. The QoS parameters in the asynchronous transfer mode (ATM) layer and the AAL (ATM adaptation layer) are defined. The focus is on the translation of QoS parameters between layers, particularly from the AAL to the ATM layer, because the AAL must be designed to be service dependent and specific. The QoS parameters at the ATM layer resulting from the translation will be the performance requirements on a connection basis for the ATM network. The impact of QoS parameter translation on guaranteeing QoS in the ATM network is discussed.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115393178","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}
引用次数: 56
Routing multipoint connections using virtual paths in an ATM network 在ATM网络中使用虚拟路径路由多点连接
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253244
M. Ammar, S. Y. Cheung, C. Scoglio
{"title":"Routing multipoint connections using virtual paths in an ATM network","authors":"M. Ammar, S. Y. Cheung, C. Scoglio","doi":"10.1109/INFCOM.1993.253244","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253244","url":null,"abstract":"The point-to-multipoint routing problem is studied for an asynchronous transfer mode (ATM) network that uses virtual paths (VPs). ATM networks with asymmetric and symmetric VPs are considered, and the performance factors studied are bandwidth and establishment and switching costs. A VP with intermediate exit, where a node that performs VP switching can copy the switched packets for the local destination, is proposed and studied. Mathematical formulations of multicast routing problems are presented, and heuristics for finding a low cost multicast routing tree, based on the transshipment simplex algorithm, are developed.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"106 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":"114979978","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}
引用次数: 64
Guaranteed bounds for steady state performance measures of a Markov chain with applications to high speed data networks 高速数据网络中马尔可夫链稳态性能度量的保证边界
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253289
M. Bonatti, A. Gaivoronski
{"title":"Guaranteed bounds for steady state performance measures of a Markov chain with applications to high speed data networks","authors":"M. Bonatti, A. Gaivoronski","doi":"10.1109/INFCOM.1993.253289","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253289","url":null,"abstract":"A method for approximation of a discrete Markov chain by a chain of considerably smaller dimension which is based on the duality theory of optimization is proposed. A novel feature of the approach is that it provides guaranteed upper and lower bounds for the performance indices defined on the steady state distribution of the original system. Several families of guaranteed bounds are defined, and the algorithms for their computation are developed. The properties of suggested bounds are illustrated by applying the approach to the problem of the statistical multiplexer dimensioning in asynchronous transfer mode (ATM) networks.<<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":"115415984","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
Robust routing for minimum worst-case expected delay in unreliable networks 不可靠网络中最小最坏情况期望延迟的鲁棒路由
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253343
R. Ogier, V. Rutenburg
{"title":"Robust routing for minimum worst-case expected delay in unreliable networks","authors":"R. Ogier, V. Rutenburg","doi":"10.1109/INFCOM.1993.253343","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253343","url":null,"abstract":"The authors consider the problem of finding a routing strategy that minimizes the worst-case expected delay from every source to a single destination in an unreliable network, given a constraint on the number of outgoing links at each node that can be inoperational at any point in time. Subject to this constraint, links can fail and recover arbitrarily often. A node having a packet to forward must choose a single link on which to transmit the packet, but does not know in advance which links will be inoperational during the transmission. If a transmission fails, the packet is retransmitted (not necessarily on the same link) after some fixed amount of time. It is shown that the optimal routing strategy is a stationary randomized strategy in which each node selects the forwarding link according to a fixed probability distribution. An efficient algorithm that computes an epsilon -optimal solution in O( mod E mod log( mod V mod / epsilon )) time, for any positive number epsilon , is presented.<<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":"124997358","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
Optimal routing algorithm for high-speed (ATM) networks 高速(ATM)网络的最优路由算法
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253269
Sungwan Park, W. Tsai
{"title":"Optimal routing algorithm for high-speed (ATM) networks","authors":"Sungwan Park, W. Tsai","doi":"10.1109/INFCOM.1993.253269","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253269","url":null,"abstract":"The gradient-projection (GP) technique is used to solve the optimal routing problem (ORP) for high-speed asynchronous transfer mode (ATM) networks. The ORP minimizing network average packet loss probability is complicated due to packet losses at intermediate switching nodes, and the problem is nonconvex. The nonconvex ORP is transformed into a convex ORP called the reduced-ORP (R-ORP), and the GP algorithm is used to obtain a routing solution. The solution obtained for the R-ORP is shown to be a good approximation of the globally optimal solution for the ORP for realistic network operating conditions. A theoretical upper bound of the difference between the R-ORP solution and the ORP solution is derived.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"22 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":"125583485","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}
引用次数: 12
Performance analysis of internally unbuffered large scale ATM switch with bursty traffic 突发流量下的内部无缓冲大型ATM交换机性能分析
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253389
Y. Oie, K. Kawahara, M. Murata, H. Miyahara
{"title":"Performance analysis of internally unbuffered large scale ATM switch with bursty traffic","authors":"Y. Oie, K. Kawahara, M. Murata, H. Miyahara","doi":"10.1109/INFCOM.1993.253389","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253389","url":null,"abstract":"The authors consider a three-stage switching configuration with no internal buffers, i.e., bufferless switches are used at the first and second stages, and output buffered switches at the third stage. Short-term cell loss probability is analyzed in order to examine the influence of bursty traffic on the performance of the bufferless switches used at the first two stages. A four-stage switching configuration with traffic distributors added at the first stage is proposed. This switch provides more paths between a pair of input and output ports than the three-stage configuration. Some schemes for distributing cells are compared. It is shown that the distributor successfully reduces cell loss probability due to bursty traffic by splitting incoming cells into several switching modules.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"21 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":"116056982","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
Timing and dispersion in WDM optical star networks WDM星光网络中的时序与色散
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253316
G. Semaan, P. Humblet
{"title":"Timing and dispersion in WDM optical star networks","authors":"G. Semaan, P. Humblet","doi":"10.1109/INFCOM.1993.253316","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253316","url":null,"abstract":"Different physical aspects that should be taken into consideration when transmitting packets in a slotted star network using wavelength-division multiplexing (WDM) are discussed. It is shown that, due to the effect of the dispersion, some padding is necessary as well as a limit on the size of the network. A method for synchronizing the transmission of slots on the different wavelengths is presented. This method is almost insensitive to the relative lengths of the transmit and receive fibers.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"20 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":"121986405","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}
引用次数: 27
Analysis of the link error monitoring algorithms in the Signaling System Number 7 protocol 信令系统7号协议中链路错误监控算法分析
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253282
V. Ramaswami, Jonathan L. Wang
{"title":"Analysis of the link error monitoring algorithms in the Signaling System Number 7 protocol","authors":"V. Ramaswami, Jonathan L. Wang","doi":"10.1109/INFCOM.1993.253282","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253282","url":null,"abstract":"Link quality in the common channel signaling (CCS) network is monitored and reported by the Signaling System No.7 (SS7) protocol level 2 signaling link error monitoring procedures. The procedures include two algorithms: the signal unit error rate monitor (SUERM), which provides one of the criteria for taking the link out of service, and the alignment error rate monitor (AERM), which determines whether a link should be put into service. The authors, motivated by the excessive link status changes observed in some field operations of the CCS network provide a detailed analysis of the signaling link error monitoring algorithms and show that under current SS7 specifications of the error monitoring algorithms, the probability of a link oscillating in and out of service could be high for certain sustained error rates. While the risk to the existing network may not be high due to the light loads carried at present, there is still a need to study the error monitoring issues thoroughly.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"11 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":"130372790","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
Analysis of message delay processes 分析消息延迟过程
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253284
I. Cidon, A. Khamisy, M. Sidi
{"title":"Analysis of message delay processes","authors":"I. Cidon, A. Khamisy, M. Sidi","doi":"10.1109/INFCOM.1993.253284","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253284","url":null,"abstract":"The authors study the message queuing delays in a node of a communication system, where a message consists of a block of consecutive packets. Two types of message generation process are distinguished. The message can be generated as a batch or it can be dispersed over time. The authors focus on the dispersed generation model. The main difficulty in the analysis is due to the correlation between the system states observed by different packets of the same message. A technique for analyzing the message delay in such systems for different arrival models is introduced, and it is shown that the correlation has a strong effect on the performance of the system. For an M/M/1 system with variable size messages, an explicit expression for the Laplace-Stieltjes transform (LST) of the message delay is obtained. It is shown that the commonly used independence assumption can lead to wrong conclusions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"2 11-12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920990","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}
引用次数: 8
Priority statistical multiplexing of mixed VBR video and CBR traffic in B-ISDN/ATM with a threshold algorithm 基于阈值算法的B-ISDN/ATM中VBR视频和CBR混合业务优先级统计复用
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings Pub Date : 1993-03-28 DOI: 10.1109/INFCOM.1993.253276
R. Izmailov, E. Ayanoglu
{"title":"Priority statistical multiplexing of mixed VBR video and CBR traffic in B-ISDN/ATM with a threshold algorithm","authors":"R. Izmailov, E. Ayanoglu","doi":"10.1109/INFCOM.1993.253276","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253276","url":null,"abstract":"The authors analyze a threshold priority access statistical multiplexing technique with a Markov modulated fluid source model for variable-bit-rate (VBR) video traffic, and an exact constant-bit-rate (CBR) model. Exact expressions for loss probabilities and delay are obtained. Based on these quality-of-service parameters, buffer size requirements of the statistical multiplexer are obtained, and the performance of a fixed threshold algorithm is compared with that of a rate-based threshold algorithm. The results provide the tradeoffs between buffer size and processing complexity for control. The exact analytical results can be used to calculate buffer size requirements.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"12 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":"116253275","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}
引用次数: 11
下一页 尾页
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学术官方微信