2013 19th IEEE International Conference on Networks (ICON)最新文献

筛选
英文 中文
Joint routing and random network coding for multi-session networks 多会话网络的联合路由和随机网络编码
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781996
Xiaoli Xu, Y. Guan
{"title":"Joint routing and random network coding for multi-session networks","authors":"Xiaoli Xu, Y. Guan","doi":"10.1109/ICON.2013.6781996","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781996","url":null,"abstract":"A joint routing and random network coding approach is introduced for the multi-session networks. With the proposed approach, part of the information is transmitted using routing, to reduce the inter-session interference, and the rest of the information is randomly combined at the intermediate nodes with proper precoding at the source nodes. The path used for routing and the corresponding routing rate can be determined using simple Fourier-Motzkin eliminations. It can be proved that proposed scheme achieves higher rate region compared with either pure routing or random network coding.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129576836","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
Network supported congestion avoidance in software-defined networks 软件定义网络中网络支持的拥塞避免
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781970
J. Gruen, Michael Karl, T. Herfet
{"title":"Network supported congestion avoidance in software-defined networks","authors":"J. Gruen, Michael Karl, T. Herfet","doi":"10.1109/ICON.2013.6781970","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781970","url":null,"abstract":"Large IP networks tend to have a highly heterogeneous structure with many different transmission segments, each endowed with individual characteristics like data rate or delay. Obviously, applications find it difficult to precisely adjust their sending behavior to the underlying topology. Basically, a higher network utilization without congestion is desirable. Server applications demand for reliable information about the available data rate in the network in order to provide a sufficient quality to the clients. Traditionally, this information is completely gathered by source and sink without interaction with the network infrastructure. The rise of software-defined networks (SDNs) enables the integration of the network into this process. In this paper we propose a rate control mechanism for software-defined networks to avoid congestion situations. The approach enables clients to communicate with the network to bidirectionally exchange information about available and occupied data rate. We found that this customized communication approach enables better network load distribution and application transmission reaction - which can be easily implemented with SDNs. Ultimately, the controller finds an efficient forwarding path in the network and the clients have a reliable upper bound for their sending data rate.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125334816","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
Multimedia optimized routing in OpenFlow networks OpenFlow网络中的多媒体优化路由
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781969
Michael Karl, J. Gruen, T. Herfet
{"title":"Multimedia optimized routing in OpenFlow networks","authors":"Michael Karl, J. Gruen, T. Herfet","doi":"10.1109/ICON.2013.6781969","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781969","url":null,"abstract":"Networks are experiencing a paradigm shift from textual data to high data rate traffic, especially carrying streaming media. Traditional network architectures can generally not keep up with this change. Software Defined Network architectures try to enable network engineers to more easily develop new transmission architectures. Current approaches of media transport, e.g. as defined by RTSP/RTP, are purely end-to-end oriented and do not consider the architecture of the underlying network. In this work we propose ways of analyzing the network state and intercepting RTSP/RTP streaming packets in Software Defined Networks with the OpenFlow 1.0 protocol. This information is used for an adept routing decision. Finally, we share our view on sample experimental scenarios where we demonstrate the benefits of the proposed transmission architecture.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125393088","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
Sketch-based data recovery in sensor data streams 传感器数据流中基于草图的数据恢复
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781943
S. Pumpichet, Xinyu Jin, N. Pissinou
{"title":"Sketch-based data recovery in sensor data streams","authors":"S. Pumpichet, Xinyu Jin, N. Pissinou","doi":"10.1109/ICON.2013.6781943","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781943","url":null,"abstract":"The data imprecision received at a base station is common in mobile wireless sensor networks. In scenarios, data cleaning based on spatio-temporal relationships among sensors is not practical due to the unique, but commonly found, characteristics of sensor networks. As one of the first methods to clean sensor data in such environments, our proposed method deploys a sketch technique to periodically summarize N sensor samples into a fixed size array of memory and manage to recover values of missing or corrupted sensor samples at the base station. Our evaluation demonstrates that, with a small fixed portion of additional data transmission compared to original N data, the proposed method outperforms the existing data cleaning methods which assume the spatio-temporal relationship among sensors.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121050306","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
RFID in-pipe moisture sensing system for oil and gas quality monitoring in Qatar 用于卡塔尔油气质量监测的RFID管道内水分传感系统
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781941
A. Nasir, B. Soong, K. Qaraqe
{"title":"RFID in-pipe moisture sensing system for oil and gas quality monitoring in Qatar","authors":"A. Nasir, B. Soong, K. Qaraqe","doi":"10.1109/ICON.2013.6781941","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781941","url":null,"abstract":"Advances in the RFID technology has made it universally present especially in the field of logistics for goods tracking. However, more and more applications are emerging enabling RFIDs to be used in a abundance of unique scenarios. Presence of moisture in an LPG, LNG pipe can decrease the quality of the gas and is one of a major problem for the industry. A wireless monitoring system using low frequency RFIDs as moisture sensors can detect the received energy of the transmitted signal using our proposed energy detector algorithm which is used extensively for spectrum sensing in Cognitive Radios to prevent such hazards. In this paper, we have employed a simple Energy Detector concept to exploit the renowned behavior of the RFID's signal reception and energy absorption with diverse environments. The decision for presence of moisture was made using the threshold values of the energy detector. The experiments were also performed in Wireless Research Laboratory at Texas A&M University at Qatar to verify the simulation results and the channel impulse response. In this study, we have shown that the RFID system can be able to send information regarding the presence of moisture for quality monitoring of liquefied gas and enable us to detect and make decisions on the basis of the energy detected from the RFID antenna system.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387780","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
Performance analysis of WDM OPS with a space priority mechanism under self-similar variable length packet traffic 自相似变长分组流量下具有空间优先级机制的WDM OPS性能分析
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6782001
Sampath K. Kumar, M. R. Perati, T. Adilakshmi
{"title":"Performance analysis of WDM OPS with a space priority mechanism under self-similar variable length packet traffic","authors":"Sampath K. Kumar, M. R. Perati, T. Adilakshmi","doi":"10.1109/ICON.2013.6782001","DOIUrl":"https://doi.org/10.1109/ICON.2013.6782001","url":null,"abstract":"In this paper, we study the switching performance of WDM optical packet switch (OPS) with a space priority mechanism, under self-similar variable length packet traffic. In this study, we model WDM OPS equipped with tunable wavelength converters as a multi-server space priority queuing system, MMPP/M/W/C. In our model, packets arriving at WDM OPS are assumed to follow Markov modulated Poisson process (MMPP) that emulates self-similar traffic. Service times are exponentially distributed to cope with variable packet length. The space priority mechanism is adapted to schedule delay sensitive real time (high priority) traffic and delay-tolerant non-real time (low priority) traffic. Simulation results are more promising and also confirm, space priority mechanism not only can maintain the Quality of Service (QoS) for the real time traffic but also can provide the optimum utilization of the capacity for non-real time traffic.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125718214","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 Cross-layer design approach in OLSR MANET using BER and weighted Connectivity Index 基于误码率和加权连通性指标的OLSR MANET跨层设计方法
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781980
T. Sanguankotchakorn, S. Wijayasekara, N. Sugino
{"title":"A Cross-layer design approach in OLSR MANET using BER and weighted Connectivity Index","authors":"T. Sanguankotchakorn, S. Wijayasekara, N. Sugino","doi":"10.1109/ICON.2013.6781980","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781980","url":null,"abstract":"Usually, Optimized Link State Routing (OLSR) protocol, a proactive routing protocols in MANET, is not aware of Quality of Service (QoS). Recently, the new approach called cross layer design has been proposed to improve the performance of wireless network, especially in MANET. In this work, we propose a heuristic approach based on cross layer design scheme to enhance performance of OLSR by using Bit Error Rate (BER) derived from physical layer together with a network layer parameter called weighted Connectivity Index (CI) which is a combination between the link connectivity and capacity. In our proposed heuristic algorithm, the approach is to find the optimized path in terms of highest weighted CI and lowest BER in order to improve the performance of Multipoint Relays (MPR) selection algorithm and route computation. The performances of the proposed scheme are investigated by simulation using Throughput, Packet Delivery Ratio, Average End-to-End Delay and Control Overhead as evaluation metrics. We compare the simulation results of our proposed scheme with the standard OLSR protocol and OLSR with only weighted CI approach. According to the simulation results, it is obvious that our proposed scheme illustrates the improvement of OLSR on the afore-mentioned evaluation metrics over the standard OLSR protocol and OLSR with weighted CI.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130718424","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
TOP-CCN: Topology aware Content Centric Networking for Mobile Ad Hoc Networks TOP-CCN:移动自组织网络拓扑感知内容中心网络
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781983
Jaebeom Kim, Daewook Shin, Young-Bae Ko
{"title":"TOP-CCN: Topology aware Content Centric Networking for Mobile Ad Hoc Networks","authors":"Jaebeom Kim, Daewook Shin, Young-Bae Ko","doi":"10.1109/ICON.2013.6781983","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781983","url":null,"abstract":"Content Centric Networking, which has simple data delivery procedures without using IP addresses, can improve content dissemination in wired networks and wireless Mobile Ad Hoc Networks (MANETs). However, the performance of CCN can be constrained in MANETs due to broadcast storming during content dissemination. Moreover, multiple content providers existing in MANET increase content announcement overhead. To solve these problems, we propose a TOPology aware CCN protocol (TOP-CCN). TOP-CCN employs the Multiple Point Relay (MPR) based packet flooding, the Publisher MPR (PMPR) based merged content announcement, and the expected hop count based flooding range control algorithm to reduce multiple content announcement overhead and broadcast storming problem. The simulation results show that TOP-CCN outperforms not only the pure CCN but also its variation in terms of content availability, network overhead, and content downloading time.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121596816","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}
引用次数: 21
Evaluating the performance of cloud services in a browser-based network measurement platform
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781955
Yao Yeboah Junior, Xiaojun Hei
{"title":"Evaluating the performance of cloud services in a browser-based network measurement platform","authors":"Yao Yeboah Junior, Xiaojun Hei","doi":"10.1109/ICON.2013.6781955","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781955","url":null,"abstract":"The emerging cloud services are often provisioned as web applications. Web browsers provide user-friendly interfaces for users to interact with different Internet contents with flexible and rich plug-in environments. Due to their ubiquitous and flexible nature, we propose to evaluate the performance of cloud services in a browser-based network measurement platform. Delay is one of the fundamental performance metrics of cloud services. The quality-of-experience (QoE) of end-users of cloud services is largely determined by the end-to-end delay between cloud servers and end-hosts at the application layer. Nevertheless, network measurement tools usually only measure network delay and it may be difficult to infer QoE using only network layer measurement approaches. In this paper, we conducted a delay measurement study using engineered scripts in the proposed browser-based measurement platform. Our investigation included a comparison study of three delay measurement methods at the application layer, including King, JavaScript and Flash ActionScript which measured application layer delay in terms of accuracy, intrusiveness, deployment, scalability, and security. We developed a browser-based delay measurement testbed over the Internet so that different delay measurement tools could be evaluated in the same real network environment. Our measurement results revealed the properties of the application layer delay over real Internet paths, and how these properties varied from the underlying network layer delay.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080529","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
Deriving and visualizing the lower bounds of information gain for prefetch systems 预取系统信息增益下界的推导和可视化
2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI: 10.1109/ICON.2013.6781978
Chung-Ping Hung, P. S. Min
{"title":"Deriving and visualizing the lower bounds of information gain for prefetch systems","authors":"Chung-Ping Hung, P. S. Min","doi":"10.1109/ICON.2013.6781978","DOIUrl":"https://doi.org/10.1109/ICON.2013.6781978","url":null,"abstract":"While prefetching scheme has been used in different levels of computing, research works have not gone far beyond assuming a Markovian model and exploring localities in various applications. In this paper, we derive two lower bounds of information gain for prefetch systems and approximately visualize them in terms of decision tree learning concept. With the lower bounds of information gain, we can outline the minimum capacity required for a prefetch system to improve performance in respond to the probability model of a data set. By visualizing the analysis of information gain, We also conclude that performing entropy coding on the attributes of a data set and making prefetching decisions based on the encoded attributes can help lowering the requirement of information tracking capacity.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126568433","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学术官方微信