2007 16th International Conference on Computer Communications and Networks最新文献

筛选
英文 中文
Zero Latency Queuing System Based on Deficit Round Robin 基于亏缺轮询的零延迟排队系统
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317841
Byoung-Chul Kim, In Suk Chun
{"title":"Zero Latency Queuing System Based on Deficit Round Robin","authors":"Byoung-Chul Kim, In Suk Chun","doi":"10.1109/ICCCN.2007.4317841","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317841","url":null,"abstract":"As the Internet grows in size and bandwidth, a variety of real time applications such as voice over IP (VoIP) and video conferences require low latency, bandwidth guarantee and delay bounded service constraints. Because current Internet provides only offer best effort services, packet scheduling algorithms supporting quality of service (QoS) requirements play an important part in switches and routers. This paper discusses a new packet scheduling discipline called zero latency queuing scheduler (ZLQS), which has one special zero latency queue (ZLQ) for real time traffic flows. When a packet comes to the ZLQ, it is serviced at a time from en-queue to de-queue without queuing latencies. The ZLQS offers zero latency queuing for real time traffic flows, and in addition it supports not only committed rate (CR)1 but also peak rate (PR)2 or burst rate (BR) for the bandwidth reservation. The ZLQS is a frame-based scheduler like deficit round robin (DRR), and therefore has the good properties of simple implementation at high speeds routers or switches, per packet work complexity of O(l) and almost perfect fairness.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133232378","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
Design of a Network Service Architecture 网络服务体系结构的设计
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317908
S. Ganapathy, T. Wolf
{"title":"Design of a Network Service Architecture","authors":"S. Ganapathy, T. Wolf","doi":"10.1109/ICCCN.2007.4317908","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317908","url":null,"abstract":"Considerable research efforts in the networking community are focused on defining a new Internet architecture that not only solves some of the problems of the current design, but also meets future needs. Our work focuses on the issue of how to provide suitable abstractions for communication between end-systems. This is a particularly important aspect of the network architecture as it is exposed to all applications and also determines what kind of services can be provided by the network. We present an architecture for network services that are implemented on router systems. We illustrate how control and data plane interact to provide the necessary end-to-end functionality. Our prototype implementation indicates that such a design is feasible and scalable for high-performance networks.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"47 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131275886","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}
引用次数: 35
Economics of Security: Research Challenges 安全经济学:研究挑战
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317892
R. Chandramouli
{"title":"Economics of Security: Research Challenges","authors":"R. Chandramouli","doi":"10.1109/ICCCN.2007.4317892","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317892","url":null,"abstract":"Economics of security is a nascent research area. In this paper we identify buyer-level, buyer-seller level and seller-level economic problems. Some open questions are identified and their implications are discussed.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131876769","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
Interference Mitigation Using Spectrum Sensing 利用频谱传感减缓干扰
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317794
S. Srikanteswara, C. Maciocco
{"title":"Interference Mitigation Using Spectrum Sensing","authors":"S. Srikanteswara, C. Maciocco","doi":"10.1109/ICCCN.2007.4317794","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317794","url":null,"abstract":"The concept of spectrum sensing is in the broad sense, the ability to detect and interpret other signals in the band and take appropriate actions by implementing adaptive techniques in the MAC layer in addition to traditional interference cancellation techniques applied in the PHY layer. In this paper we present algorithms to detect interference to WLAN systems in the 2.4GHz spectrum originating from microwave ovens or frequency hopping devices like cordless phone, and methods to mitigate the interference. The concept can be extended to other coexistence issues as well as spectrum sharing between primary and secondary users of a spectrum.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436373","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
Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks 无线传感器网络中保持阈值覆盖的节点替换策略
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317909
S. Parikh, V. Vokkarane, L. Xing, D. Kasilingam
{"title":"Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks","authors":"S. Parikh, V. Vokkarane, L. Xing, D. Kasilingam","doi":"10.1109/ICCCN.2007.4317909","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317909","url":null,"abstract":"With the rapid deployment of wireless sensor networks, there are several new sensing applications with specific requirements. Specifically, target tracking applications are fundamentally concerned with the area of coverage across a sensing site in order to accurately track the target. We consider the problem of maintaining a minimum threshold-coverage in a wireless sensor network, while maximizing network lifetime and minimizing additional resources. We assume that the network has failed when the sensing coverage falls below the minimum threshold-coverage. We develop three node-replacement policies to maintain threshold-coverage in wireless sensor networks. These policies assess the candidature of each failed sensor node for replacement. Based on different performance criteria, every time a sensor node fails in the network, our replacement policies either replace with a new sensor or ignore the failure event. The node-replacement policies replace a failed node according to a node weight. The node weight is assigned based on one of the following parameters: cumulative reduction of sensing coverage, amount of energy increase per node, and local reduction of sensing coverage. We also implement a first-fail-first-replace policy and a no-replacement policy to compare the performance results. We evaluate the different node-replacement polices through extensive simulations. Our results show that given a fixed number of replacement sensor nodes, the node-replacement policies significantly increase the network lifetime and the quality of coverage, while keeping the sensing-coverage about a pre-set threshold.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114503966","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}
引用次数: 39
Adaptive bit loading for coded MIMO-OFDM 编码MIMO-OFDM的自适应位加载
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317811
Harry Z. B. Chen, L. Lampe, R. Schober
{"title":"Adaptive bit loading for coded MIMO-OFDM","authors":"Harry Z. B. Chen, L. Lampe, R. Schober","doi":"10.1109/ICCCN.2007.4317811","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317811","url":null,"abstract":"Orthogonal frequency-division multiplexing (OFDM) with multiple transmit and receive antennas (MIMO-OFDM) and adaptive bit-loading (ABL) offers reliable high-data rate communication for systems with moderate mobility as considered in e.g. IEEE 802.16e. In this paper, we propose and optimize wrapped space-time coding (WSTC) for bit-loaded MIMO-OFDM. We further optimize V-BLAST with ABL by mitigating error propagation inherent in its detection process. We compare their performances with benchmark schemes known from the literature. Simulation results show that WSTC-based MIMO-OFDM achieves excellent error rate performances while feedback requirements for loading are low.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116986271","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
An Efficient Detection Technique for SC-FDE Systems with Multiple Packet Collisions 多包冲突SC-FDE系统的有效检测技术
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317852
R. Dinis, M. Serrazina, P. Carvalho
{"title":"An Efficient Detection Technique for SC-FDE Systems with Multiple Packet Collisions","authors":"R. Dinis, M. Serrazina, P. Carvalho","doi":"10.1109/ICCCN.2007.4317852","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317852","url":null,"abstract":"Usually, packets involved in a collision are lost, requiring the retransmission of all packets. However, if we do not discard collided packets and we use proper retransmissions we can efficiently resolve collisions. In this paper we propose a technique that allows an efficient packet separation in the presence of successive collisions. We consider an SC (Single-Carrier) modulation with FDE (Frequency-Domain Equalization) and we propose a frequency-domain multi-packet detection scheme. Since our technique requires uncorrelated channels for different retransmissions, we also propose a PS technique (Packet-Shift) for retransmissions using the same channel. Our technique allows high throughputs, since the total number of transmissions is equal to the number of packets involved in the collision. Moreover, the complexity is concentrated in the receiver, making this technique particularly appealing to the uplink of broadband wireless systems. By employing the PS scheme we can use the same channel for the retransmissions, with only a small performance degradation.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399765","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
Diffusion Approximations for the GI/G/c/K queue GI/G/c/K队列的扩散近似
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317896
A. Takahashi, Y. Takahashi, S. Kaneda, N. Shinagawa
{"title":"Diffusion Approximations for the GI/G/c/K queue","authors":"A. Takahashi, Y. Takahashi, S. Kaneda, N. Shinagawa","doi":"10.1109/ICCCN.2007.4317896","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317896","url":null,"abstract":"Although diffusion approximations are widely used for analyzing non-Markovian queueing systems, so far there are few results on the relationship between the approximation accuracy and a combination choice of two boundary conditions and two discretization for finite-capacity multi-server queuing systems. The finite-capacity system requires two boundary conditions at origin (x=0) and capacity limit (x=K). Taking account of this requirement, four types of diffusion approximations have been presented. We present accuracy comparisons among four types of diffusion approximations which differ from one another in the boundary conditions and the discretizations. We observe that the coefficient of variation of the inter-arrival time distribution is a key factor for choosing the appropriate combination of the boundary conditions and the discretizations.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122133184","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
Traffic Oriented Topology Formation and Load-balancing Routing in Wireless Mesh Networks 面向流量的无线网状网络拓扑形成与负载均衡路由
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317956
Han Zhang, D. Tsang
{"title":"Traffic Oriented Topology Formation and Load-balancing Routing in Wireless Mesh Networks","authors":"Han Zhang, D. Tsang","doi":"10.1109/ICCCN.2007.4317956","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317956","url":null,"abstract":"Wireless mesh networks (WMNs) have emerged as a key technology for the next-generation wireless networking. Due to infrequent topology change and unreliable wireless links, a fundamental problem arisen is how to form an optimal topology to meet the traffic requirement. In this paper, we propose a joint optimization design on topology formation and traffic routing, which is formulated as a linear binary programming (LBP) problem. Since LBP is difficult to solve except for very small-size problems, we provide an efficient approximation method based on the decomposition method. Numerical results show that our approximation method not only obtains a very good performance, but also it reduces the number of network interfaces required by mesh nodes. Moreover, our approximation method significantly reduces the computation complexity and is capable of providing solution to practical problems when mathematical packages cannot offer a feasible solution.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128305234","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
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks 探讨无线传感器网络中移动传感器的负载均衡调度
2007 16th International Conference on Computer Communications and Networks Pub Date : 2007-09-24 DOI: 10.1109/ICCCN.2007.4317894
You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Y. Tseng
{"title":"Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks","authors":"You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Y. Tseng","doi":"10.1109/ICCCN.2007.4317894","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317894","url":null,"abstract":"In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event locations to conduct more advanced analysis. By exploring the load balance concept, we propose a CentralSD algorithm to efficiently dispatch mobile sensors. Our algorithm is general in that the numbers of mobile sensors and events can be arbitrary. When mobile sensors are more than event locations, we transform the dispatch problem to a maximum-matching problem in a weighted bipartite graph. When there are fewer mobile sensors than event locations, we propose an efficient clustering scheme to group event locations so that the maximum-matching approach can still be applied. To reduce message cost, we also develop a distributed GridSD algorithm. Simulation results are presented to verify the effectiveness of the proposed algorithms.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129117792","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}
引用次数: 47
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学术官方微信