Proceedings of Sixth International Conference on Computer Communications and Networks最新文献

筛选
英文 中文
Time dependent priority scheduling for guaranteed QoS systems 保证QoS系统的时间依赖优先级调度
Shailender Chaudhry, A. Choudhary
{"title":"Time dependent priority scheduling for guaranteed QoS systems","authors":"Shailender Chaudhry, A. Choudhary","doi":"10.1109/ICCCN.1997.623318","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623318","url":null,"abstract":"With the advances in server technology, and the advent of fast gigabit networks, it has become possible to support multimedia applications. To support the requirements for the transmission of isochronous data, the network must provide service guarantees to connections, including minimum bandwidth, packet delay, delay jitter, and loss. Three factors determine the utilization of the network when providing these services. These are the scheduling algorithm employed at each switch; the accuracy (tightness) of the admission control (schedulability condition) that detects violations to the service guarantees; accuracy of the input traffic characterization. In this paper we present a scheduling algorithm, its schedulability condition and implementation. The schedulability condition is free of input traffic characterization and thus any input traffic model can be used. Further, the algorithm is capable of achieving up to maximum efficiency possible at each switch.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123432576","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
Analyzing the latency of the Totem multicast protocols 图腾组播协议时延分析
E. Thomopoulos, L. Moser, P. Melliar-Smith
{"title":"Analyzing the latency of the Totem multicast protocols","authors":"E. Thomopoulos, L. Moser, P. Melliar-Smith","doi":"10.1109/ICCCN.1997.623289","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623289","url":null,"abstract":"Multicast group communication protocols provide a foundation on which distributed systems can be built. The performance of these protocols is, however, not easy to characterize or to analyze. This research determines probability density functions for the latency to message delivery for the Totem multicast protocols, which provide reliable totally ordered delivery of multicast messages across single and multiple local-area networks (LANs). Totem uses a logical token-passing ring on each LAN with gateways that forward messages selectively between LANs. Comparing the performance of single-ring, two-ring and four-ring networks shows that, with message filtering in the gateways, multiple-ring networks can achieve lower mean latency, less variability in the latency, and shorter tails of the latency distribution than an equivalent single-ring network.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123701879","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
@INGate: a distributed intelligent network approach to bridge switching and packet networks @INGate:一种用于桥接交换和分组网络的分布式智能网络方法
P. Hofmann, M. Rebensburg, Dieter Rueffler, P. Simeonov
{"title":"@INGate: a distributed intelligent network approach to bridge switching and packet networks","authors":"P. Hofmann, M. Rebensburg, Dieter Rueffler, P. Simeonov","doi":"10.1109/ICCCN.1997.623336","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623336","url":null,"abstract":"This paper presents the results of a joint project initiative, @INGate, in the area of computer/telephony network integration (CTNI) carried out by Siemens AG and the Technical University of Berlin. We propose a distributed intelligent network architecture (DINA) that implements a unified media communications service (UMCS) providing both messaging and telephony services along with network computing and service management throughout circuit switching and packet networks. The architecture comprises a series of interconnected and locally managed intelligent service nodes as interworking units (IWU) between heterogenous networks allowing the user access to a unified media store/bus (UMS/B) via traditional PSTN/ISDN/GSM equipment such as telephones, pagers and fax machines on the one hand and networked computers and PDAs equipped with mail readers and Web browsers on the other hand to enable both on-line and off-line communication. The core of this architecture is the network-bridge service node (NB-SN), a distributed intelligent network element (DINE) consisting of a channel matrix switch (CMS) and a data packet switch (DPS) to link to fixed/mobile telephony and data networks correspondingly, several resource platforms (RPs) connected to media conversion processors (MCPs) to perform media translation in required interchange formats, an Internet gateway (IG) for IP telephony and data access (including customer service control and agent-based network computing) holding the subscribers' mailboxes and providing the Internet connectivity, and a network-bridge service node controller (NB-SNC) to control the overall service logic and the above components. The NB-SN itself is managed along with other nodes in a distributed intelligent network (IN) by a TMN-compliant operation, administration and maintenance center (OAMC).","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217593","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}
引用次数: 7
Static caching in Web servers Web服务器中的静态缓存
I. Tatarinov, A. Rousskov, V. Soloviev
{"title":"Static caching in Web servers","authors":"I. Tatarinov, A. Rousskov, V. Soloviev","doi":"10.1109/ICCCN.1997.623344","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623344","url":null,"abstract":"This paper studies caching in primary Web servers. We use log files from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold and the Pitkow/Recker (1994) policy. Web document access patterns change very slowly. Based on this fact, we propose and evaluate static caching, a novel cache policy for Web servers. In static caching, the set of documents kept in the cache is determined periodically by analyzing the request log file for the previous period. The cache is filled with documents to maximize cache performance provided document access patterns do not change. The set of cached documents remains constant during the period. Surprisingly, this simple policy results in high cache performance, especially for small cache sizes. Unlike other policies, static caching incur no CPU overhead and does not suffer from memory fragmentation.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122017820","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
An imprecise algorithm for real-time compressed image and video transmission 一种用于实时压缩图像和视频传输的不精确算法
Xiao Chen, A. Cheng
{"title":"An imprecise algorithm for real-time compressed image and video transmission","authors":"Xiao Chen, A. Cheng","doi":"10.1109/ICCCN.1997.623341","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623341","url":null,"abstract":"One major requirement for multimedia systems is the efficient transmission of multimedia information over a communication or computer network. Several commercial products heave been developed to apply compression techniques to images and videos in order to reduce their transmission time. Sufficient available time and bandwidth lead to satisfactory results, but image/video loss occurs if these resources are insufficient. Using imprecise computation theory, we can achieve a good tradeoff between the quality of the transmitted image/video and the available resources such as the time for transmission. However, for a compressed image file, this very flexible technique cannot be easily applied since a compressed file cannot be uncompressed if it is not transmitted completely. This paper proposes an imprecise compressed image/video transmission technique which combines the advantages of both compression and imprecise computation for the first time. Our experimental results show that the proposed algorithm has better results compared to simply using compression or imprecise transmission techniques, and has a good potential for commercial use.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130666695","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}
引用次数: 29
Overload control of SCP in advanced intelligent network with fairness and priority 基于公平优先级的高级智能网络SCP过载控制
Yong Lee, Joo-Seok Song
{"title":"Overload control of SCP in advanced intelligent network with fairness and priority","authors":"Yong Lee, Joo-Seok Song","doi":"10.1109/ICCCN.1997.623295","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623295","url":null,"abstract":"In this paper we propose two mechanisms for overload control of the service control point (SCP) in an AIN; a continuous gapping method and a new arrival gapping method. They are all interactive mechanisms in which an SCP and service switching points (SSPs) exchange load information for overload control. These mechanisms are based on general automatic code gapping and apply different call gapping times to each SSP under the fairness scheme. Also in the mechanisms, a priority scheme is implemented. The two mechanisms show almost the same results on the call throughput. Fairness about the probability of rejection is maintained with the same value on all SSPs. On the priority scheme, the new arrival gapping method has better priority achievement than the continuous gapping method.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123353983","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
Dynamic bandwidth allocation for real-time VBR video traffic in ATM networks ATM网络中实时VBR视频流量的动态带宽分配
H. Chu, D. Tsang
{"title":"Dynamic bandwidth allocation for real-time VBR video traffic in ATM networks","authors":"H. Chu, D. Tsang","doi":"10.1109/ICCCN.1997.623328","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623328","url":null,"abstract":"We study the problem of dynamic bandwidth allocation for an ATM multiplexer loaded with real-rime VBR video traffic. The proposed mechanism adjusts the allocated bandwidth at regular intervals based on measured QoS. Instead of actual measurement of small cell loss ratios, we combine a virtual output buffer method with a regression method to shorten the time interval required for estimating the required bandwidth to support the specified QoS by prediction. Using numerical examples, we show that our proposed dynamic bandwidth allocation scheme is more efficient than the optimum static bandwidth allocation scheme. Our measurement-based scheme offers several advantages: (1) it removes the dependence on accurate traffic parameters to be declared by users; (2) it can be applied to a wide variety of traffic sources; (3) it adapts quickly to the variations of traffic with small measurement intervals, and (4) the complexity of the algorithm is small.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124303537","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}
引用次数: 9
Multispace search for minimizing the maximum nodal degree 最小化最大节点度的多空间搜索
B. Du, J. Gu, Wei Wang, D. Tsang
{"title":"Multispace search for minimizing the maximum nodal degree","authors":"B. Du, J. Gu, Wei Wang, D. Tsang","doi":"10.1109/ICCCN.1997.623337","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623337","url":null,"abstract":"Hajek and Sasaki (1988) showed that, for continuous traffic and packet radio network, the selection of paths that minimize the maximum nodal degree generates schedules of minimum-length. This result suggests that minimization of the maximum nodal degree provides good (although not necessarily optimal) performance in slotted networks with fixed-length packets. We give a multispace search algorithm that interplays structural operations in conjunction with a local search algorithm for the minimization of the maximum nodal degree. Structural operations disturb the environment of forming local minima, which makes multispace search a very natural approach to the problem. Experimental results indicate that this method has improved local search in terms of the solution quality and its sensitivity to the initial random assignment.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133601388","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 burst-level priority scheme for bursty traffic in ATM networks 针对ATM网络中突发业务的突发级优先级方案
Jose Roberto Fernandez, M. Mutka
{"title":"A burst-level priority scheme for bursty traffic in ATM networks","authors":"Jose Roberto Fernandez, M. Mutka","doi":"10.1109/ICCCN.1997.623285","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623285","url":null,"abstract":"Statistical gain is achieved in asynchronous transfer mode (ATM) networks by making bursty connections share resources stochastically. When connections with different QOS requirements share the same resources, the highest QOS requirements would typically be the limiting factor in determining the admissible load at a link. This may lead to connections with low QOS requirements getting better service than they require, leading to an underutilization of the resources. To alleviate this problem, a burst-level priority scheme is proposed. In the proposal, burst of related cells are to be handled in the network on a burst-by-burst basis. Bandwidth is allocated to bursts on-the-fly according to their priorities. This proposal includes a two-level priority CAC scheme for controlling the burst-level blocking rates of independent heterogeneous on-off sources.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132161530","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
Flexible multicast protocol 灵活的组播协议
iversite de Savoie
{"title":"Flexible multicast protocol","authors":"iversite de Savoie","doi":"10.1109/ICCCN.1997.623309","DOIUrl":"https://doi.org/10.1109/ICCCN.1997.623309","url":null,"abstract":"This paper presents FMP, a flexible multicast protocol based on the SRM algorithm in order to guarantee a reliable multipoint communication support. FMP is intended to strengthen the SRM repair/request policies, as well as to optimise the recovery treatments in case of failure occurence. Moreover, FMP is designed to meet the variety of needs of multicast applications by providing a mean to select the suitable service at the application level. Estelle is used to specify one of the FMP's functionalities, i.e. the reliable multicast.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132385620","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
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学术官方微信