2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)最新文献

筛选
英文 中文
Measuring available bandwidth of multiple parts on end-to-end network path 测量端到端网络路径上多个部分的可用带宽
K. Koitani, G. Hasegawa, M. Murata
{"title":"Measuring available bandwidth of multiple parts on end-to-end network path","authors":"K. Koitani, G. Hasegawa, M. Murata","doi":"10.1109/CQR.2012.6267101","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267101","url":null,"abstract":"The available bandwidth on an end-to-end network path is an important metric for detecting network congestion, adapting transmission rate, configuring paths and topologies on overlay networks, and so on. The existing available bandwidth measurement techniques aimed only at knowing available bandwidth of the bottleneck part on the path and most of them do not specify where is the bottleneck, and they do not measure available bandwidth of each part of the path separately. Also, they can not measure available bandwidth of multiple parts on the path. In this paper, we propose a simultaneous measurement method of available bandwidth of multiple parts on an end-to-end network path. The proposed method estimates the available bandwidth based on changes in packet sending and arrival intervals under the situation where intermediate routers on the path can record time on incoming packets as a timestamps. We present extensive simulation results of the proposed method and confirm that it can accurately measure available bandwidth of each part on the path even when the available bandwidth of the sender-side network is smaller than that of the receiver-side network.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132485249","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
Block-based fair queuing: An efficient network QoS provisioning algorithm for high-speed data transmission 基于块的公平排队:一种高效的高速数据传输网络QoS提供算法
Shu-Hsin Chang, Wei-Chi Ting, Chun-Yu Chuang, Shih-Yu Wang
{"title":"Block-based fair queuing: An efficient network QoS provisioning algorithm for high-speed data transmission","authors":"Shu-Hsin Chang, Wei-Chi Ting, Chun-Yu Chuang, Shih-Yu Wang","doi":"10.1109/CQR.2012.6267098","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267098","url":null,"abstract":"We propose an extension of WFQ, called BWFQ, to reduce the computation time and guarantee the QoS performances as well. Simplifications of the WFQ algorithm may degrade the performance of all sessions. Instead, BWFQ dynamically aggregates packets in advance and performs scheduling in unit of block. Block size is controlled by a parameter called granule. Each session has a granule setting in accordance with its delay tolerance. Delay-insensitive sessions form larger data blocks so that a lot of computation time at scheduling is saved. BWFQ also employs block-preemptive scheduling to allow interruption of the block on service and switch to another one with the highest priority. Performance isolation guarantees a delay upper bound for every session that is independent of others' granule settings. Simulation results show that BWFQ is capable of saving a great amount of computation, especially under traffic congestion.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127408639","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
Low latency dynamic bandwidth allocation for 100km long reach 10G-EPON 100km长距离10G-EPON的低延迟动态带宽分配
D. Murayama, N. Oota, K. Suzuki, N. Yoshimoto
{"title":"Low latency dynamic bandwidth allocation for 100km long reach 10G-EPON","authors":"D. Murayama, N. Oota, K. Suzuki, N. Yoshimoto","doi":"10.1109/CQR.2012.6267104","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267104","url":null,"abstract":"We propose a new dynamic bandwidth allocation (DBA) method for long reach passive optical networks (PON) that can shorten upstream latency. In this method, the OLT allocates bandwidth to long-distance (up to 100 km) ONUs preliminarily and shortens the latency of long-distance optical network units (ONUs). This has no influence on the latency of short-distance ONUs if they coexist with long-distance ONUs. We show that this new DBA method achieves a smaller latency with long-distance ONUs than the conventional DBA technique, and that there is no influence on short-distance ONUs.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129769576","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
Approximation method for evaluating frequency of long service outages in telecommunications networks 评估电信网络长时间服务中断频率的近似方法
M. Hayashi
{"title":"Approximation method for evaluating frequency of long service outages in telecommunications networks","authors":"M. Hayashi","doi":"10.1109/CQR.2012.6267096","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267096","url":null,"abstract":"An approximation method is presented for evaluating the frequency of long service outages in telecommunications networks. It measures how often a long service outage occurs, which is important because long service outages can seriously affect customers. The method currently used is problematic because the evaluation time increases exponentially with the telecommunications network size. A recently proposed approximation method by Watanabe et al. is highly accurate but its evaluation time also increases exponentially. Other known heuristic approximations are applicable only to cases in which the telecommunications network can be represented by series and/or parallel systems. The method proposed here overcomes these limitations. It is based on a simple equation that includes the frequency of long service outage and the frequency of failure. This equation gives both the upper and lower bounds of the value obtained with Watanabe's method, where these bounds are very close to each other, under the reasonable assumption that each element of a telecommunications networks is highly reliable. Numerical examples show that this method can be used to more quickly and more accurately evaluate the frequency of service outages for a realistically large network.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257894","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
QoS in high throughput Data Vortex optical interconnection network 高吞吐量数据旋涡光互连网络的QoS
Qimin Yang
{"title":"QoS in high throughput Data Vortex optical interconnection network","authors":"Qimin Yang","doi":"10.1109/CQR.2012.6267111","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267111","url":null,"abstract":"In this paper, Quality of Service (QoS) capabilities is incorporated to a previously proposed Data Vortex network architecture with 3×3 routing nodes implementation. While the 3×3 node implementation allows for speedup and much higher throughput performance, the traffic load must be kept medium to maintain the reasonably low packet drop rate. The addition of QoS capability within the routing node allows the network to support multiple classes of traffic, and selectively drop the packets based on their priority. In the simulation study, two priority traffics are considered with proper modification of routing node logic. The results show that with slight increase in routing decision complexity, the high priority traffic can be guaranteed much better performance in packet drop rate. The average latency performance is also slightly improved for high priority traffic in comparison to low priority traffic. The low priority traffic encounters slightly more packet drop rate as a result, and this becomes more significant as the network reaches performance saturation. The proposed QoS implementation allows for overall reasonable network performance as the non-QoS network, and it provides much better performance for higher priority traffic for practical applications. Since the low priority traffic encounters more sacrifice at heavy traffic loads, overall traffic is still desired to be controlled at a reasonable level.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121188257","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
An efficient and scalable engine for large scale multimedia overlay networks 一个高效和可扩展的引擎,用于大规模多媒体覆盖网络
P. Montessoro, S. Wieser, L. Boszormenyi
{"title":"An efficient and scalable engine for large scale multimedia overlay networks","authors":"P. Montessoro, S. Wieser, L. Boszormenyi","doi":"10.1109/CQR.2012.6267109","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267109","url":null,"abstract":"When dealing with multimedia delivery, scalability, efficiency and Quality of Service (QoS) are challenging features for today's networks. Overlay networks can compensate for the lack of control over the network routers, but for real-world applications overlay network performance is an issue. This paper presents an efficient solution for software implementation of overlay network nodes. A new, advanced Distributed Linked Data Structures (DLDS) schema has been developed to provide scalable per-flow resource reservation and fast, searchless routing/forwarding table lookup. This schema has been integrated in a new overlay network framework that features hierarchical dynamic routing and QoS estimation based on performance measures of the underlying network. The proposed technique has been implemented and tested in a large, realistic network simulation environment, and experimental results are presented.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114647487","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
Theoretic performance analysis of cable networks with strategic subscribers 战略用户有线网络的理论性能分析
Haihong Gao, T. Best, R. Pendse, M. E. Sawan
{"title":"Theoretic performance analysis of cable networks with strategic subscribers","authors":"Haihong Gao, T. Best, R. Pendse, M. E. Sawan","doi":"10.1109/CQR.2012.6267106","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267106","url":null,"abstract":"The quality of service of a computer network is greatly affected by the behavior of its participants. This paper proposes and utilizes an analytic model to study cable network performance when its participants function strategically. The model is based on game theory, system theory, and probability theory. The cable network studied is considered a multi-agent system, and the performance is evaluated with several social welfare metrics. This theoretical study concludes that the overall network performance may degrade significantly and the desired quality of service set by network service providers may not be realizable when its network participants act independently.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133947021","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
Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles 稀疏分光DWDM网络中使用p周期的可靠组播会话配置
A. Frikha, S. Lahoud, Bernard A. Cousin, M. Molnár
{"title":"Reliable multicast sessions provisioning in sparse light-splitting DWDM networks using p-cycles","authors":"A. Frikha, S. Lahoud, Bernard A. Cousin, M. Molnár","doi":"10.1109/CQR.2012.6267097","DOIUrl":"https://doi.org/10.1109/CQR.2012.6267097","url":null,"abstract":"In this paper, we study the node and link protection using p-cycles for dynamic multicast sessions in all-optical DWDM networks. First, we propose a new concept for protecting nodes of light-trees under the sparse light-splitting and wavelength continuity constraints. Then, we integrate our concept in a novel algorithm, named node and link protecting candidate p-cycles based algorithm with sparse light-splitting constraints (NPCC-SSC). Our algorithm enables both node and link failure recovery in dynamic multicast traffic. Extensive simulations show that the NPCC-SSC algorithm achieves the best resource utilization, and outperforms the existing approaches in terms of blocking probability and computational time.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127008455","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学术文献互助群
群 号:604180095
Book学术官方微信