2007 15th IEEE International Conference on Networks最新文献

A Novel WDM EPON Architecture with Wavelength Spatial Reuse in High-Speed Access Networks 高速接入网中波长空间复用的新型WDM EPON体系结构

2007 15th IEEE International Conference on Networks Pub Date : 2007-12-01 DOI: 10.1109/ICON.2007.4444078

Wang-Rong Chang, Hui-Tang Lin, Sheng-Jhe Hong, Chai-Lin Lai

引用次数: 17

Approximation Techniques For Analytical Characterization Of Downlink Traffic Power For Multi-Service CDMA Networks 多业务CDMA网络下行业务功率分析表征的近似技术

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-19 DOI: 10.1109/ICON.2007.4444110

A. Mahmoud, Mohammed A. Aabed

{"title":"Approximation Techniques For Analytical Characterization Of Downlink Traffic Power For Multi-Service CDMA Networks","authors":"A. Mahmoud, Mohammed A. Aabed","doi":"10.1109/ICON.2007.4444110","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444110","url":null,"abstract":"This paper presents a novel analytical framework for characterizing the downlink power allocations for a multi-rate code division multiple access (CDMA) network. The characterization takes into account the RF propagation model, the shadowing process and considers both intracell and intercell interference. To arrive at the model, the paper utilizes approximation techniques recently developed in the recent literature to evaluate the sum of lognormal random variables. The overall traffic power is modeled as a random variable that is function of the network parameters and the assigned downlink bit rates. The paper demonstrates the calculation of the forward link power outage probability as one example application for the developed characterization. It also compares between two approximation techniques suggested in this paper: matched first and second order statistics, and the min-max technique. The analytical results are compared to those obtained via Monte-Carlo simulations to assess the accuracy of the adapted approximations. The results indicate the min-max technique produces more accurate results when compared to matched first and second moments approximation scheme.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121796086","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 New Pre-emption Policy For MPLS-TE Networks 一种新的MPLS-TE网络抢占策略

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-19 DOI: 10.1109/ICON.2007.4444119

I. Chaieb, J. L. Roux, Bernard A. Cousin

引用次数: 3

Minimizing the Number of Constraints for Shared Backup Path Protection (SBPP) in Shared Risk Link Group (SRLG) Optical Mesh Networks SRLG (Shared Risk Link Group)光网状网络中共享备份路径保护约束数量最小化

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444094

D. Habibi, Viet Q. Phung, H. Nguyen

引用次数: 2

JavaCard-based Two-Level User Key Management for IP Conditional Access Systems 基于javacard的IP条件访问系统两级用户密钥管理

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444064

Jinyoung Moon, Jongyoul Park, E. Paik

{"title":"JavaCard-based Two-Level User Key Management for IP Conditional Access Systems","authors":"Jinyoung Moon, Jongyoul Park, E. Paik","doi":"10.1109/ICON.2007.4444064","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444064","url":null,"abstract":"To prohibit the unauthorized accesses on premium contents of the Pay-TV system, a conditional access system (CAS) scrambles the contents with a scrambling key. In order to securely send the scrambling key for descrambling, the CAS transmits the scrambling key after encrypting it with another encryption key. The encryption keys are generally transmitted by entitlement management message (EMM). In this paper, we propose a two-level user key management scheme for the IP CAS used in the IPTV system. A user key for every subscriber is subdivided into permanent subscriber key (SK) and updatable user key (UK). The SK is used to obtain the UK by an authentication protocol. According to the authentication protocol, the authentication server requests the results of cryptographic operations to the authentication client to verify the authentication client. The UK is used to encrypt the next encryption key. The proposed scheme strengthens the security of the IP CAS because the use of the UK for the EMMs enables the lifetime of the SK to be infinite and the replacement of the smartcard to be eliminated. In addition, the IP CAS adopts Java card instead of Smart card because Java card applets are able to be dynamically reloaded.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128675563","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}

引用次数: 15

Enhancing the multicast performance of structured P2P overlay in supporting Massively Multiplayer Online Games 在支持大型多人在线游戏中增强结构化P2P覆盖的组播性能

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444073

Xinbo Jiang, F. Safaei, P. Boustead

{"title":"Enhancing the multicast performance of structured P2P overlay in supporting Massively Multiplayer Online Games","authors":"Xinbo Jiang, F. Safaei, P. Boustead","doi":"10.1109/ICON.2007.4444073","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444073","url":null,"abstract":"Scribe is a scalable application level multicast infrastructure. We have developed two techniques to improve the performance of Scribe in terms of latency and bandwidth distribution. The first technique identifies that the final hop of Scribe traffic path is largely selected without any proximity consideration and incurs the longest distance traveled. To overcome this, we introduce Proximity Neighbor Selection (PNS) into the final hop for latency improvement. The second technique builds a hierarchical two-level overlay. While PNS can be applied at both levels for latency performance, the bandwidth stress required by applications can now be distributed among the nodes in the higher level overlay. Our simulation using GT-ITM topology has shown that both techniques have improved the latency performance for more than 30 percent, and the two-level overlay has improved the bandwidth distribution up to 2.7 times, comparing with what can be achieved by a standard Scribe overlay. We have developed the techniques in the context of Massively Multiplayer Online Games (MMOGs). While Scribe provides a possible platform for the scalable deployment of MMOGs, game developers may leverage the techniques to enhance the design of real-time interactions between players in the game world.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000267","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

A Cache Architecture for Counting Bloom Filters 一种用于计数布隆过滤器的缓存架构

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444089

M. Ahmadi, Stephan Wong

引用次数: 17

Wireless Channel Detection Based on Fluctuation of Packet Arrival Interval 基于数据包到达间隔波动的无线信道检测

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444103

Yoshihisa Kondo, S. Itaya, S. Yamaguchi, P. Davis, R. Suzuki, S. Obana

引用次数: 1

Efficient Real Time Content Delivery on Wireless Networks 无线网络上的高效实时内容传递

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444115

Ramana Isukapalli

{"title":"Efficient Real Time Content Delivery on Wireless Networks","authors":"Ramana Isukapalli","doi":"10.1109/ICON.2007.4444115","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444115","url":null,"abstract":"Wireless networks are very popular today; however, the bandwidth over the air interface is limited to support many real time applications like video on demand. While some of these applications require high quality picture frames with high resolution, large image size, etc., many others (like remote surveillance) need simple and continuous, yet intelligible image frames that are not jittery. A video server that has an estimate of the available bandwidth can stream high quality data if the bandwidth is available, or stream data that needs lower bandwidth (perhaps with a lower size, lower frame rate, etc.) if the available bandwidth is limited. Unfortunately, that poses two issues - first, the video server should be aware of the available bandwidth. Second, it should be able to modify the content it streams, \"dynamically\". In this paper, we do a detailed analysis of some popular \"controlled lossy compression\" methods that are used to reduce the overall \"entropy\" of the source data (video stream), leading to a smaller data size and reducing the overall bandwidth requirements. We discuss these methods in the context of image processing techniques and show how they can modify the data of stored video content, as needed, to present an intelligible video stream that is smaller is size. We present an end to end architecture that (i) uses \"RTCP\" to get an estimate of the available channel bandwidth and (ii) uses a video server that can dynamically change the parameters like image size and frame rate to produce video streams that are best suited for the available bandwidth. We present theoretical compression rates for each of these compression methods and present empirical results to confirm our claims.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131208151","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

A Study of Localized On-Demand Data Collection in Sensor Networks 传感器网络中本地化按需数据采集的研究

2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444125

R. Teng, Bing Zhang, Yasuo Tan

{"title":"A Study of Localized On-Demand Data Collection in Sensor Networks","authors":"R. Teng, Bing Zhang, Yasuo Tan","doi":"10.1109/ICON.2007.4444125","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444125","url":null,"abstract":"In sensor networks, users can collect the sensing data in an on-demand manner. Upon receiving a user's query message, each sensor node that is corresponding to the query delivers the sensing data to the sink node. However, directly forwarding query message throughout the network will cause a large traffic overhead and high energy consumption. In addition, directly forwarding all sensing data toward the sink node via many independent paths might be inefficient with regards to energy consumption and energy distribution. In this paper, we propose a localized query forwarding and data collection scheme based on the processing of the attribute content of the query's name. In contrast to the conventional distributions of data query, a query's name is resolved into the IDs and the locations of corresponding group of sensor nodes before being distributed to the network. Therefore, the query is efficiently forwarded into the network within a localized area. Furthermore, the sensing data are collected and aggregated at intermediate nodes that reside among the corresponding sensor nodes, before being forwarded to the sink node. We also attempt to extensively study the performance on an 802.15.4 integrated ns-2 simulator. The simulation results reveal that the proposed approaches highly reduce the energy consumption of data query and data collection in the network and the energy distribution is more efficiently distributed among sensor nodes than conventional approaches.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640965","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