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

Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.最新文献

筛选
英文 中文
Traffic scheduling in Bluetooth network 蓝牙网络中的流量调度
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962367
V. Sangvornvetphan, T. Erke
{"title":"Traffic scheduling in Bluetooth network","authors":"V. Sangvornvetphan, T. Erke","doi":"10.1109/ICON.2001.962367","DOIUrl":"https://doi.org/10.1109/ICON.2001.962367","url":null,"abstract":"Bluetooth is a wireless ad-hoc network concept using a universal short-range radio link for communicating electronic devices in a small area. The Bluetooth radio nodes form piconets and provide a slotted time division duplex (TDD) scheme in which each slot is 0.625 ms long. This work studies traffic performance in a piconet focusing on \"mean packet delay\" and \"probability of packet loss\" of data traffic. A mix of data and voice traffic is used in the simulation where data traffic streams are modeled by an interrupted Bernoulli process. The priority, round robin, and \"alternating priority\" scheduling schemes are studied and compared. The alternating priority scheme turns out to be a fair and efficient scheme and it has almost as good overall performance as in the priority scheme.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127185701","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
Synchronizing multimedia flows in active-high-speed networks 同步主动式高速网络中的多媒体流
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962316
S. Fatmi, N. Boudriga
{"title":"Synchronizing multimedia flows in active-high-speed networks","authors":"S. Fatmi, N. Boudriga","doi":"10.1109/ICON.2001.962316","DOIUrl":"https://doi.org/10.1109/ICON.2001.962316","url":null,"abstract":"The main requirement of multimedia stream transfer is to guarantee the quality of service contracted between the user and the network. We are particularly interested by the synchronization constraints between different data streams flowing through a high-speed network. Our approach aims to regulate the streams progress reducing the gap observed between these streams and assuming that intermediate nodes in the network are capable of performing appropriate procedures that can be pre-defined by the user and the network manager. This intelligence allows the network nodes to manage the data streams, unlike passive carriers, by accelerating data units arriving after critical delays. We particularly address the case of active-ATM technologies and define for this purpose the active-ATM architecture that is needed for multimedia flow synchronization.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130760324","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
A design and analysis of top-down based ACK-trees 基于自顶向下的ack树的设计与分析
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962337
E. Kim, S. Koh, Juyoung Park, Singak Kang, Jongwon Choe
{"title":"A design and analysis of top-down based ACK-trees","authors":"E. Kim, S. Koh, Juyoung Park, Singak Kang, Jongwon Choe","doi":"10.1109/ICON.2001.962337","DOIUrl":"https://doi.org/10.1109/ICON.2001.962337","url":null,"abstract":"For reliable multicast service, to use a tree hierarchy can be a promising solution to avoid the well-known ACK-implosion. However, to build an efficient ACK-tree is very difficult for IP multicast because it does not provide explicit membership and routing topology information to the upper layer protocol. Due to the difficulties, not much study has been done on the control tree configuration yet, while it immensely affects the behavior and performance on a protocol using the mechanism. Previous approaches can be classified into top-down and bottom-up, and promising previous works have typically been focused on the bottom-up construction mechanism, because the top-down approach has some drawbacks like long tree creation time. However, the ERS-based mechanism, one of the representative bottom-up mechanisms, is known to cause heavy message overhead. Thus, we propose a novel method which takes the benefits of the top-down approach while relieving its most significant drawback, long tree creation time, adopting the concurrent tree creation concept from the bottom-up approach. We show the proposed mechanism reduces message overhead as well as builds a low level of tree. In addition, we achieve medium performance on tree creation time.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133696480","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
A performance study of a service covering protocol in ad hoc networks 自组织网络中服务覆盖协议的性能研究
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962322
E. Fleury, H. Koubaa
{"title":"A performance study of a service covering protocol in ad hoc networks","authors":"E. Fleury, H. Koubaa","doi":"10.1109/ICON.2001.962322","DOIUrl":"https://doi.org/10.1109/ICON.2001.962322","url":null,"abstract":"With the rising number of Internet services, extensive research on service location protocols is a very important feature for future networks. We discuss the performance of a service covering protocol designed for ad hoc networks. Our on-demand protocol is based on a distributed approach which contributes to traffic overhead optimization.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124021713","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
A new efficient group signature scheme based on linear codes 基于线性码的高效群签名方案
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962328
J. Ma, T. C. Chiam, A. Kot
{"title":"A new efficient group signature scheme based on linear codes","authors":"J. Ma, T. C. Chiam, A. Kot","doi":"10.1109/ICON.2001.962328","DOIUrl":"https://doi.org/10.1109/ICON.2001.962328","url":null,"abstract":"An efficient group signature scheme is presented. The security of this scheme is based on the difficulty of the decoding problem of linear codes, and the security of the ElGamal signature scheme. For a given [n, k, d] code and the corresponding group signature scheme, the lengths of the signatures and the group public key are n+5 and n/sup 2/+5 respectively. With regard to the computational overhead of this scheme, the signing process is basically the same as the ElGamal scheme but with O(n) arithmetic operations; the procedure of opening a signature is very efficient and needs only O(d/sup 2/) arithmetic operations. This scheme allows new members to join a group without modifying the group public key. By distributing new membership certificates to some members, a member can be deleted from a group.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581376","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
Using XML-based real-time model for distributed real-time multimedia systems 采用基于xml的实时模型实现分布式实时多媒体系统
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962315
T. Tsang
{"title":"Using XML-based real-time model for distributed real-time multimedia systems","authors":"T. Tsang","doi":"10.1109/ICON.2001.962315","DOIUrl":"https://doi.org/10.1109/ICON.2001.962315","url":null,"abstract":"In order to manipulate multimedia objects effectively to users, there has been great demand for multimedia modelling languages which can provide various ways of presentation with multiple multimedia objects. We propose a Web-based XML modelling language called RT-XML, which is capable of expressing the manipulation of distributed real-time multimedia objects. The real-time statements of RT-XML are added to a subclass of XML. RT-XML includes time constraint, scheduling, probabilistic behaviour and qualitative description of multimedia streams. Finally, we present an application of RT-XML for controlling the delivery of multimedia services, which include resource management and real-time capabilities.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121414447","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
Selective security for TLS TLS的选择性安全性
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962343
M. Portmann, A. Seneviratne
{"title":"Selective security for TLS","authors":"M. Portmann, A. Seneviratne","doi":"10.1109/ICON.2001.962343","DOIUrl":"https://doi.org/10.1109/ICON.2001.962343","url":null,"abstract":"Today's computing environments are becoming increasingly heterogeneous, mostly due to the growth of mobile computing. In this environment, application layer proxies that can adapt and tailor the content to the client's needs and capabilities as well as to the available network resources are highly beneficial. The problem is that content adaptation proxies are generally incompatible with the notion of end-to-end security. The only generic solution to this problem is the concept of selective security. The idea is to apply security selectively only to the sensitive elements of a data stream and expose the rest to any intermediary system for potential content adaptation. None of the currently used security protocols provides an API for fine-grained control of the application of security mechanisms to a data stream. We propose a simple extension to the transport layer security protocol (TLS), which provides the application with an interface for selectively protecting elements within a data stream. We also discuss a generic application scenario that shows how the proposed extended features can be used in conjunction with content adaptation proxies.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129166584","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}
引用次数: 16
Scrambling and key distribution scheme for digital television 数字电视的加扰和密钥分配方案
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962331
Wachiwan Kanjanarin, T. Amornraksa
{"title":"Scrambling and key distribution scheme for digital television","authors":"Wachiwan Kanjanarin, T. Amornraksa","doi":"10.1109/ICON.2001.962331","DOIUrl":"https://doi.org/10.1109/ICON.2001.962331","url":null,"abstract":"The scrambling scheme is a part of the conditional access system (CAS) that is used to prevent unauthorized access to Pay-TV systems. We propose a new scrambling scheme and key distribution scheme. The scrambling scheme is used in conjunction with ordinary encryption techniques, for protecting the digital video streams from unauthorized viewing. A hash function and a pseudo-random number generator are used to prepare the video stream before being encrypted. The proposed scheme helps reduce computational time and complexity while providing the same level of security as encrypting the entire video stream. In addition, the proposed secure key distribution scheme can be used with any, scrambling scheme e.g. with our scrambling scheme. By using the Chinese remainder theorem (CRT) for distributing parameters in the scrambling process, the security of the scheme can be increased. Moreover, our scheme can prevent two common problems, namely, smart card cloning and McCormac Hack.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129371473","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}
引用次数: 42
An investigation into performance of congestion control mechanisms in ATM-UBR service for TCP sources 基于TCP源的ATM-UBR业务拥塞控制机制性能研究
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962386
J. Phunitatkul, T. Erke
{"title":"An investigation into performance of congestion control mechanisms in ATM-UBR service for TCP sources","authors":"J. Phunitatkul, T. Erke","doi":"10.1109/ICON.2001.962386","DOIUrl":"https://doi.org/10.1109/ICON.2001.962386","url":null,"abstract":"The performance of congestion control mechanisms in UBR service for TCP sources is investigated. Not only static TCP sources but also dynamic TCP sources are applied to investigate the performance of congestion control in the practical way. For static sources, the result from random early detection (RED) achieves high efficiency but not the highest fairness. RED improves fairness slightly less than FBA. For dynamic sources, the efficiency is not much different for each UBR drop policy according to the different traffic profiles. RED performs the highest fairness. The difference of implementation between the other schemes and RED as the other schemes are most appropriate to implement with the instantaneous queue length, but that RED is appropriate to implement with the average queue length which is suitable for the real or dynamic Internet traffic characteristic.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344576","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
Feedback consolidation algorithm for ABR point-to-multipoint connections in ATM networks ATM网络中ABR点对多点连接的反馈整合算法
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001. Pub Date : 2001-10-10 DOI: 10.1109/ICON.2001.962369
M. El-Derini, A. E. El-Abd, Wael Hosny Fouad Aly
{"title":"Feedback consolidation algorithm for ABR point-to-multipoint connections in ATM networks","authors":"M. El-Derini, A. E. El-Abd, Wael Hosny Fouad Aly","doi":"10.1109/ICON.2001.962369","DOIUrl":"https://doi.org/10.1109/ICON.2001.962369","url":null,"abstract":"The point-to-multipoint ABR service in ATM networks is important for many data applications. Resource management (RM) cells are used by receivers to return back to the source an explicit rate indicating their bandwidth fair share on the bottleneck of the path leading to them. Switches in the multicast tree consolidate the information in backward RM cells received from downstream switches or receivers and forward this consolidated information to their upstream switch. A number of algorithms have been developed for extending ABR congestion avoidance algorithms to perform feedback consolidation at the branch points. A demonstration of the performance of the proposed algorithm compared with some other algorithms through a set of numerical examples is presented. We used the ATM/HFC network simulator version 4.1, released December 1998 by the American National Institute for Standards and Technology (NIST). The simulator code is modified to make the algorithm.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115205610","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
首页 上一页 下一页 尾页
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学术官方微信