2006 International Symposium on Computer Networks最新文献

筛选
英文 中文
A tool system for automatic scheduling of data exchange in real-time distributed embedded systems 实时分布式嵌入式系统中数据交换自动调度的工具系统
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662530
V. Balashov, V. Kostenko, R. Smeliansky, S. V. Vavinov
{"title":"A tool system for automatic scheduling of data exchange in real-time distributed embedded systems","authors":"V. Balashov, V. Kostenko, R. Smeliansky, S. V. Vavinov","doi":"10.1109/ISCN.2006.1662530","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662530","url":null,"abstract":"In this paper we address the problem of automatic generation of a data exchange schedule for the MIL STD-1553B multiplex data bus. This bus is widely used in modern real-time distributed embedded systems. Static scheduling strategy is typically used to build a schedule of data exchanges over this bus. We present heuristic algorithms developed to perform the scheduling with optimization of bus load and number of scheduled exchange commands. During the integration phase of the embedded system development, it is often the case that a correct data exchange schedule cannot be constructed due to excessive requirements to communication through the bus. We present algorithms for generation of suggestions on how to change the requirements within given ranges in order to make the schedule construction possible. A tool system for automatic generation of data exchange schedules is also presented, with its structure and key features","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880904","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
Limitations of existing wireless networks authentication and key management techniques for MANETs 现有无线网络认证和密钥管理技术的局限性
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662516
G. A. Safdar, Clare McGrath, Máire O’Neill
{"title":"Limitations of existing wireless networks authentication and key management techniques for MANETs","authors":"G. A. Safdar, Clare McGrath, Máire O’Neill","doi":"10.1109/ISCN.2006.1662516","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662516","url":null,"abstract":"Providing security support for mobile networks is challenging. Masquerading and eavesdropping are major threats to the security of wireless communications and mobile networks. To provide proper protection for the communication of the wireless link, the contents of the communication should be enciphered and mutual authentication should be conducted between the communicating nodes. Authentication protocols and key management techniques play a vital role and are the basis of security in many distributed systems. Much research has been conducted into the development of key management techniques and authentication protocols for WLAN (802.11b, 802.11i, 802.15.1, HIPERLAN) and traditional wireless networks (GSM, UMTS). This paper specifically describes the fundamental limitations of these underlying techniques and protocols and discusses why they cannot be directly employed in mobile ad hoc networks (MANETs). To the best of the authors' knowledge, this is the first paper which collectively addresses the limitations of the security mechanisms used in existing wireless networks for MANETs","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126126805","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
A QoS routing architecture for multi-domain networks 多域网络的QoS路由体系结构
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662540
H. A. Mantar
{"title":"A QoS routing architecture for multi-domain networks","authors":"H. A. Mantar","doi":"10.1109/ISCN.2006.1662540","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662540","url":null,"abstract":"Differentiated services (Diffserv) has become a de facto forwarding plane technology for achieving quality of service (QoS) in the Internet due to its great scalability. However, Diffserv does not address control plane functionality. For end-to-end QoS in large-scale Diffserv networks, a control mechanism is needed. The bandwidth broker is the strongest candidate for this. In this paper, we propose a novel route server (RS) architecture, compatible with the BB model, for inter-domain QoS routing. The RS is the only entity that performs both intra-and inter-domain QoS routing in its domain. In particular, the RS has two routing components, interior route server (iRS) responsible for intra-domain QoS routing and exterior route server (eRS) responsible for inter-domain QoS routing. The preliminary implementation results verify the achievements of the proposed architecture","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042101","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
Message buffering in epidemic data dissemination 流行病数据传播中的信息缓冲
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662541
Emrah Ahi, M. Çağlar, Öznur Özkasap
{"title":"Message buffering in epidemic data dissemination","authors":"Emrah Ahi, M. Çağlar, Öznur Özkasap","doi":"10.1109/ISCN.2006.1662541","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662541","url":null,"abstract":"In reliable group communication, epidemic or probabilistic protocols gained popularity due to their scalability to large number of peers and robustness against network failures. Reliability properties of these protocols are ensured via probabilistic guarantees. A key issue to consider when offering reliability is the buffer space used by individual peers of the group. Our aim is to optimize the buffer space while providing reliability in epidemic data dissemination protocols. We introduce a novel randomized model and compare it with a hash-based approach for buffer management. The effect of short and long term buffering of peers and the buffer size on delivery latency and reliability are considered. We compute the performance measures through simulations of large-scale application scenarios","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132675335","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
Adaptive online scheduling for asymmetric wireless sensor networks 非对称无线传感器网络的自适应在线调度
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662511
S. Balasubramanian, D. Aksoy
{"title":"Adaptive online scheduling for asymmetric wireless sensor networks","authors":"S. Balasubramanian, D. Aksoy","doi":"10.1109/ISCN.2006.1662511","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662511","url":null,"abstract":"Increasing onboard processing capabilities of sensors enable self-organization in wireless sensor networks to dynamically adapt to ad-hoc topologies and to react to task or network changes. Such self-organization, however, comes at a cost of additional energy consumption of the sensor nodes with already limited power resources. Energy limitations of sensor nodes in unattended environments require a trade-off between power consumption and topology maintenance. In this paper we present our adaptive online scheduling (AOS) protocol that exploits application based data flow characteristics to reduce power consumption during self-organization. Data flow characteristics is used to govern route selection, and to formulate a collision-free transmission schedule that enables risk-free sleeping time. Our simulation results suggest that AOS's transmission schedule provides more than 50% energy savings in steady state in comparison to SMACS","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131083509","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
A novel no-latency simple-to-implement sender-based packet-loss recovery technique for multimedia streams 一种新颖的、无延迟的、易于实现的基于发送方的多媒体流丢包恢复技术
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662532
Behnam Rahnama, Atilla Elçi
{"title":"A novel no-latency simple-to-implement sender-based packet-loss recovery technique for multimedia streams","authors":"Behnam Rahnama, Atilla Elçi","doi":"10.1109/ISCN.2006.1662532","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662532","url":null,"abstract":"We consider recovery techniques for packet-loss in the multimedia streams at both sender- and receiver-sides. We investigate recovery techniques as bases of useless packet transmission avoidance in order to release bandwidth by avoiding sending unintelligible packets. At times, packet-loss exceeds a given threshold such that recovery techniques are not able to cope with packet-losses. Therefore, algorithms supplying lower latency and higher degree of recovery are needed. Moreover, faster algorithms for generating packets, transmitting, and recovering from losses in the streams, help managing unintelligible flow for the various multimedia streams. Here, we propose the fast forward algorithm (FFA) that removes latency in packet generation, is practical, and is very simple to implement. FFA is equally suitable for interactive and non-interactive applications. Simulation is used to show that FFA is superior to other interleaving methods","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131634259","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
Adaptive multimedia streaming over IP based on customer oriented metrics 基于客户导向度量的IP自适应多媒体流
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662531
D. López, Francisco González, L. Bellido, Angel Alonso
{"title":"Adaptive multimedia streaming over IP based on customer oriented metrics","authors":"D. López, Francisco González, L. Bellido, Angel Alonso","doi":"10.1109/ISCN.2006.1662531","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662531","url":null,"abstract":"Delivering multimedia services over IP is expected to represent a significant contribution to final revenues of most telcos and content producers. This new paradigm of customer-made, on-demand services calls for new approaches to the whole life cycle service management. In this article an analytical method to determine the delivered quality of experience is presented. It does so from an end-user point of view for it helps network operators to better fulfil their customer's expectations. Being an analytical approach, it explicitly states the existing relationship of delivered quality and observable network metrics thus enabling solid service management procedures","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708836","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}
引用次数: 41
Migration Scenarios for Metro Networks A migration roadmap for metro access networks 城域网络迁移场景城域接入网迁移路线图
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662502
J. Palacios, Á. Ferreiro, J. Lobo, K. Wajda, N. L. Sauze
{"title":"Migration Scenarios for Metro Networks A migration roadmap for metro access networks","authors":"J. Palacios, Á. Ferreiro, J. Lobo, K. Wajda, N. L. Sauze","doi":"10.1109/ISCN.2006.1662502","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662502","url":null,"abstract":"Network operators have been facing big changes since IP traffic began overwhelming other kinds of data transport. On the other hand, access networks are continuously improving and it is anticipated that bandwidth demands exponentially increase within next decade to cope with triple-play service requirements. The first level of aggregation, namely metro access networks, can become the bottleneck if no serious modifications are carried out because they were initially designed for circuit-oriented services such as analogical voice transmission and they can not keep up with bandwidth demands at reasonable capital expenditure efforts. In this paper, the authors present a migration roadmap for metro access networks derived from the results of NOBEL, ePhoton/One and FIRM European research projects. To achieve it, dual bus optical ring network (DBORN), resilient packet ring (RPR) and optical circuit switched rings (OCSR) architectures have been analyzed both from the technological and the economic point of view in the short and medium term","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115082003","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
On the vertical handoff decision for wireless overlay networks 无线覆盖网络的垂直切换决策
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662518
F. Tansu, M. Salamah
{"title":"On the vertical handoff decision for wireless overlay networks","authors":"F. Tansu, M. Salamah","doi":"10.1109/ISCN.2006.1662518","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662518","url":null,"abstract":"The evolution of mobile multimedia services outlines a trend towards the coexistence of wireless overlay networks. These networks have overlaid coverage areas and are composed of a hierarchical structure ranging from in-room to in-building, campus, metropolitan, and wide-areas. For these networks to work as a seamless inter-working, optimal mobility management has to be implemented. Beside the traditional horizontal handoffs between cells of the same network, vertical handoffs between different networks have more impact on system performances. One of the important challenges for seamless vertical mobility is to maintain a user active connectivity while the user is changing its point of attachment. In this paper we are addressing one aspect of the mobility management, namely the vertical handoff decision problem in wireless overlay networks, in this study, an algorithm is proposed to avoid the unnecessary vertical handoffs for such networks under different circumstances. Simulation results on the key parameters such as grade of service (GoS) and system utilization prove that the proposed strategy can provide powerful support for QoS in wireless overlay networks","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121691236","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}
引用次数: 38
SLiT (strongly connected light-trail) for WDM rings 用于WDM环的狭缝(强连接光迹)
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662525
A. Gumaste, N. Ghani, S. Jain, Si-Qing Zheng
{"title":"SLiT (strongly connected light-trail) for WDM rings","authors":"A. Gumaste, N. Ghani, S. Jain, Si-Qing Zheng","doi":"10.1109/ISCN.2006.1662525","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662525","url":null,"abstract":"Light-trail as a candidate for dynamic provisioning and sub-wavelength grooming has been investigated before. A light-trail is an example of an intelligent unidirectional wavelength bus. In this article, we extend the conceptual advantages of light-trails to a bidirectional wavelength bus, which we call as SLiT or strongly connected light-trails. We investigate and propose new node architecture for demonstration of SLiTs in a WDM ring network. To enable communication in a SLiT network we propose a stable and convergent protocol for dynamic bandwidth arbitration as well as for governing the virtual topology. We compare the performance of SLiT networks with light-trail network and other contemporary solutions through a simulations study","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131376890","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书