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

2006 International Symposium on Computer Networks最新文献

筛选
英文 中文
A Framework for providing QoS routing in MANETs 在manet中提供QoS路由的框架
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662514
Shahram Mohrehkesh, S. Bastani, A. Shafigh, M. Fathy
{"title":"A Framework for providing QoS routing in MANETs","authors":"Shahram Mohrehkesh, S. Bastani, A. Shafigh, M. Fathy","doi":"10.1109/ISCN.2006.1662514","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662514","url":null,"abstract":"The aim of this work is to propose a framework for providing QoS routing in MANETs. The proposed framework uses local information of nodes such as node's speed, buffer, and power to select path for routing. Deploying these information, more stable paths are selected and hence QoS routing parameter could be satisfied. Moreover, routing performance has been improved, especially in terms of end-to-end delay. The proposed framework performs in a distributed fashion and uses only local information of nodes, so it does not generate any additional packets and does not impose any overhead on network. We provide some simulation results to show the efficiency of the framework","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"45 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":"121123708","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
Constraint-Based Routing in Traffic Engineering 交通工程中基于约束的路由
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662507
A. Karaman
{"title":"Constraint-Based Routing in Traffic Engineering","authors":"A. Karaman","doi":"10.1109/ISCN.2006.1662507","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662507","url":null,"abstract":"Traffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraint-based routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"22 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":"121594193","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
Design and implementation of two-level VPN service provisioning systems over MPLS networks 基于MPLS网络的两级VPN业务发放系统的设计与实现
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662506
Li-Der Chou, M. Hong
{"title":"Design and implementation of two-level VPN service provisioning systems over MPLS networks","authors":"Li-Der Chou, M. Hong","doi":"10.1109/ISCN.2006.1662506","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662506","url":null,"abstract":"Virtual private network (VPN) services are getting important due to the expansion of enterprises and the requirement for securely transferring confidential data. The populations using VPN services include service provider administrators, local enterprise device managers, and end users. Service provider administrators provide interconnectivity among separated local devices, while local enterprise device managers provide network connectivity for end users. In the paper a two-level VPN service provisioning system is designed and implemented. In the system there are two parts: provider edge manager (PER) deployed in service provider backbone, and customer edge manager (CAR) deployed in local enterprise networks. PER deals with provisioning multi-protocol label switching (MPLS) VPN service to local device manager, and CAR takes charge of deploying customer premises edge-based (CPE-based) VPN services for end users. Local device managers can deploy CPE-based VPN services over MPLS VPN services provided by service provider administrators, through the exchanges of VPN status and control information between PER and CAR","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"11 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":"115040786","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
Handoff Prioritizing Schemes in Cellular Wireless Networks 蜂窝无线网络中的切换优先级方案
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662512
Vassily Abdulova, Isik Aybay
{"title":"Handoff Prioritizing Schemes in Cellular Wireless Networks","authors":"Vassily Abdulova, Isik Aybay","doi":"10.1109/ISCN.2006.1662512","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662512","url":null,"abstract":"This paper provides a detailed discussion of nonprioritized and prioritized handoff schemes. It presents a survey of published papers in this area. Moreover, an extensive classification of handoff prioritizing schemes is presented in this paper","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"162 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":"131680677","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}
引用次数: 19
Chaotic UWB quadrature chaos shift keying for wireless sensors and coexistence with direct sequence spread spectrum systems 无线传感器的混沌超宽带正交混沌移位键控及其与直接序列扩频系统共存
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662543
G. Plitsis
{"title":"Chaotic UWB quadrature chaos shift keying for wireless sensors and coexistence with direct sequence spread spectrum systems","authors":"G. Plitsis","doi":"10.1109/ISCN.2006.1662543","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662543","url":null,"abstract":"Chaos-based modulation schemes have been proposed as alternatives of conventional digital communication systems. Wireless dust sensor systems is a term describing cubic millimeter scale sensor nodes envisioned to fulfil large scale monitoring tasks. IEEE 802.15.4 is an under standardization air interface for low rate WPANs. The corresponding throughput and bit error rate of the QCSK coexistence with direct sequence spread spectrum systems are being presented with the use of mathematical models","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"27 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":"129344009","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
Competition-based load balancing for distributed systems 基于竞争的分布式系统负载平衡
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662539
A. Abed, G. Oz, A. Kostin
{"title":"Competition-based load balancing for distributed systems","authors":"A. Abed, G. Oz, A. Kostin","doi":"10.1109/ISCN.2006.1662539","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662539","url":null,"abstract":"The aim of this paper is to propose a new competition-based load balancing scheme and investigate it. The system is composed of a set of workstation clusters. The paper deals with balancing for multi-task concurrent applications, as well as for independent tasks. We developed a simulation load balancing system (LOBAS) that was used to test a competition driven load balancing algorithm. The results obtained show viability of such algorithm. The algorithm has a potential for scalability with respect to the number of tasks","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"220 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":"116490190","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
An optimistic fair e-commerce protocol for large e-goods 大型电子商品的乐观公平电子商务协议
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662536
Cagil Can Oniz, E. Savaş, A. Levi
{"title":"An optimistic fair e-commerce protocol for large e-goods","authors":"Cagil Can Oniz, E. Savaş, A. Levi","doi":"10.1109/ISCN.2006.1662536","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662536","url":null,"abstract":"Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want or neither gets anything. In this paper, a fair e-commerce protocol for large e-goods is proposed and implemented. The proposed protocol provides a method for the fair exchange of e-money for e-products, and a method for verifying the contents of the exchanged items. The protocol is optimistic and efficient such that when none of the parties tries to cheat, only three messages are sufficient. In case of disputes, three more messages are needed. Furthermore, the customer remains anonymous after the transaction; thus, no information about the customers' shopping habits can be gathered through the protocol. The implementation results show that the protocol is efficient and secure and that only a small number of cryptographic operations is sufficient","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"35 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":"131917850","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
DST: delay sensitive transport in wireless sensor networks DST:无线传感器网络中的延迟敏感传输
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662519
V. C. Gungor, Ö. Akan
{"title":"DST: delay sensitive transport in wireless sensor networks","authors":"V. C. Gungor, Ö. Akan","doi":"10.1109/ISCN.2006.1662519","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662519","url":null,"abstract":"In this paper, the delay sensitive transport (DST) protocol is presented for wireless sensor networks (WSN). The objective of the DST protocol is to timely and reliably transport event features from the sensor field to the sink with minimum energy consumption. In this regard, the DST protocol simultaneously addresses congestion control and timely event transport reliability objectives in WSN. In addition to its efficient congestion detection and control algorithms, it incorporates the time critical event first (TCEF) scheduling mechanism to meet the application-specific delay bounds at the sink node. Importantly, the algorithms of the DST protocol mainly run on resource rich sink node, with minimal functionality required at resource constrained sensor nodes. Performance evaluation via simulation experiments show that the DST protocol achieves high performance in terms of real-time communication requirements, reliable event detection, and energy consumption in WSN","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"42 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":"133774876","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}
引用次数: 71
A practical approach to scatternet formation and routing on Bluetooth 蓝牙散射网形成和路由的实用方法
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662503
S. Altundağ, M. Gokturk
{"title":"A practical approach to scatternet formation and routing on Bluetooth","authors":"S. Altundağ, M. Gokturk","doi":"10.1109/ISCN.2006.1662503","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662503","url":null,"abstract":"Bluetooth is a mobile ad-hoc network aiming to serve voice, video, and data applications. Piconet is the smallest Bluetooth network unit that can be formed by a group of nodes. Scatternets are formed by joining piconets. In this paper, a practical scatternet formation protocol and an application utilizing this protocol are introduced. Scatternet formation protocols proposed until now are slow to establish the network for many application types. The suggested protocol is built on the experience gained from other scatternet formation protocols, ad-hoc routing protocols and sensor network routing protocols. It is practical, quick to establish, and easy to operate when data is flowing across the network","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":"134072416","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
Analysis of the node isolation attack against OLSR-based mobile ad hoc networks 基于olsr的移动自组网节点隔离攻击分析
2006 International Symposium on Computer Networks Pub Date : 2006-07-31 DOI: 10.1109/ISCN.2006.1662504
Bounpadith Kannhavong, Hidehisa Nakayama, N. Kato, Y. Nemoto, A. Jamalipour
{"title":"Analysis of the node isolation attack against OLSR-based mobile ad hoc networks","authors":"Bounpadith Kannhavong, Hidehisa Nakayama, N. Kato, Y. Nemoto, A. Jamalipour","doi":"10.1109/ISCN.2006.1662504","DOIUrl":"https://doi.org/10.1109/ISCN.2006.1662504","url":null,"abstract":"Recent advances in wireless networking technologies have made it possible to construct a mobile ad hoc network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, they are much more vulnerable to malicious attacks than a conventional wired network. In MANET, routing plays an important role in providing connectivity for mobile nodes who are not within the same radio range. Existing routing protocols in MANET assume a trusted and reliable environment. However, in hostile environment mobile nodes are susceptible to various types of routing attacks. This paper identifies a new routing attack, called node isolation attack, against optimized link state routing (OLSR) protocol, one of the four standard routing protocols for MANETs. We analyze in detail and demonstrate the impact of this attack in order to show the necessity for a countermeasure to guard against the attack. As a first step to defend against the attack, we present a simple technique to detect the attack and identify the source of the attack","PeriodicalId":304528,"journal":{"name":"2006 International Symposium on Computer Networks","volume":"15 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":"129083732","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}
引用次数: 67
首页 上一页 下一页 尾页
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学术官方微信