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

Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)最新文献

筛选
英文 中文
Removing cell demultiplexing performance bottleneck in ATM pseudo wire emulation over MPLS networks 消除MPLS网络上ATM伪线仿真中的小区解复用性能瓶颈
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284236
Puneet Konghot, Hao Che
{"title":"Removing cell demultiplexing performance bottleneck in ATM pseudo wire emulation over MPLS networks","authors":"Puneet Konghot, Hao Che","doi":"10.1109/ICCCN.2003.1284236","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284236","url":null,"abstract":"Cell multiplexing is highly desirable to achieve increased transport efficiency in asynchronous transfer mode (ATM) pseudo wire emulation over a multiprotocol label switching (MPLS) network. However, supporting cell multiplexing can create performance bottleneck at the egress provider edge (PE) where fully programmable network processors are used to do the cell demultiplexing. In this paper, a scheme is proposed to allow a large number of cells to be demultiplexed, without having to implement special ASIC-based hardware optimized for cell demultiplexing. The idea is to configure concatenated data plane processing devices to share the cell demultiplexing task with the egress PE. Analysis shows that the use of just two processing devices is sufficient to achieve high transport efficiency. This may as well be achieved by the addition of one router without a central control card. Therefore, service providers can employ this scheme to enable cell multiplexing with limited add-on cost, while preserving the existing investment.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134348926","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
Evaluation of SCTP multistreaming over wireless/satellite links 无线/卫星链路上SCTP多流的评估
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284230
Mohammed Atiquzzaman, W. Ivancic
{"title":"Evaluation of SCTP multistreaming over wireless/satellite links","authors":"Mohammed Atiquzzaman, W. Ivancic","doi":"10.1109/ICCCN.2003.1284230","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284230","url":null,"abstract":"In this paper, we study the impact of multistreaming on the performance of SCTP over satellite networks. We first show that multistreaming results in higher goodput than single streams when the receiver buffer is constrained as in the case of wireless handheld devices. We then demonstrate that the multistreaming feature of SCTP results in reduced buffer requirements at the receiver in the presence of losses in the satellite network. The above advantages makes SCTP an attractive transport protocol for wireless handheld devices.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129608213","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}
引用次数: 26
Modeling the DOCSIS 1.1/2.0 MAC protocol DOCSIS 1.1/2.0 MAC协议建模
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284171
Jim Martin, Nitin Shrivastav
{"title":"Modeling the DOCSIS 1.1/2.0 MAC protocol","authors":"Jim Martin, Nitin Shrivastav","doi":"10.1109/ICCCN.2003.1284171","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284171","url":null,"abstract":"A model of the data over cable (DOCSIS) version 1.1/2.0 MAC and physical layers using the ns simulation package is developed. In this paper we present the results of a performance analysis that we have conducted using the model. The main objective of our study is to examine the performance impact of several key MAC layer system parameters as traffic loads are varied. We focus on the DOCSIS best effort service. We measure the level of ACK compression experienced by a downstream TCP connection and show that even under moderate load levels DOCSIS can cause TCP acknowledgement packets to compress in the upstream direction leading to bursty (and lossy) downstream dynamics. We explore the use of downstream rate control on network performance and find that it does reduce the level of ACK compression for moderate load levels compared to an equivalent network scenario without rate control. However, as the number of active subscribers on a given channel increase, the level of ACK compression grows implying that other mechanisms should be looked at to improve performance during periods of high usage.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132406303","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}
引用次数: 18
Scheduling with dynamic bandwidth allocation for DiffServ classes 为DiffServ类调度动态带宽分配
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284188
Mei Yang, E. Lu, S. Zheng
{"title":"Scheduling with dynamic bandwidth allocation for DiffServ classes","authors":"Mei Yang, E. Lu, S. Zheng","doi":"10.1109/ICCCN.2003.1284188","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284188","url":null,"abstract":"The diverse service requirements of emerging Internet applications faster the need for flexible and scalable IP quality-of-service (QoS) schemes. Due to its simplicity and scalability, DiffServ is expected to be widely deployed across the Internet. Though DiffServ supporting scheduling algorithms for output-queueing (OQ) switches have been widely studied, there are few DiffServ scheduling algorithms for input-queueing (IQ) switches. In this paper, we propose the dynamic DiffServ scheduling (DDS) algorithm for IQ switches to provide dynamic bandwidth allocation for DiffServ classes. The basic idea of DDS is to schedule EF and AF traffic according to their minimum service rates with the reserved bandwidth and schedule AF and BE traffic fairly with the excess bandwidth. We evaluate the performance of DDS under bursty traffic arrivals and compare it with PQWRR, an existing scheduling algorithm suitable for supporting DiffServ for OQ switches. Simulations results show that DDS provides minimum bandwidth guarantees for EF and AF traffic and fair bandwidth allocation for BE traffic. DDS also achieves the delay and jitter performance for EF traffic close to that of PQWRR and the delay performance for AF traffic better than that of PQWRR at high loads. Using comparator-tree based arbitration components, it is feasible to implement DDS in hardware at high speed.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133100906","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
PINCO: a pipelined in-network compression scheme for data collection in wireless sensor networks PINCO:一种用于无线传感器网络中数据采集的网络内流水线压缩方案
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284221
Tarik Arici, B. Gedik, Y. Altunbasak, Ling Liu
{"title":"PINCO: a pipelined in-network compression scheme for data collection in wireless sensor networks","authors":"Tarik Arici, B. Gedik, Y. Altunbasak, Ling Liu","doi":"10.1109/ICCCN.2003.1284221","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284221","url":null,"abstract":"In this paper, we present PINCO, an in-network compression scheme for energy constrained, distributed, wireless sensor networks. PINCO reduces redundancy in the data collected from sensors, thereby decreasing the wireless communication among the sensor nodes and saving energy. Sensor data is buffered in the network and combined through a pipelined compression scheme into groups of data, while satisfying a user-specified end-to-end latency bound. We introduce a PINCO scheme for single-valued sensor readings. In this scheme, each group of data is a highly flexible structure so that compressed data can be recompressed without decompressing, in order to reduce newly available redundancy at a different stage of the network. We discuss how PINCO parameters affect its performance, and how to tweak them for different performance requirements. We also include a performance study demonstrating the advantages of our approach over other data collection schemes based on simulation and prototype deployment results.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114998851","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}
引用次数: 120
A variable degree based clustering algorithm for networks 一种基于变度的网络聚类算法
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284210
Jie Lian, G. Agnew, S. Naik
{"title":"A variable degree based clustering algorithm for networks","authors":"Jie Lian, G. Agnew, S. Naik","doi":"10.1109/ICCCN.2003.1284210","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284210","url":null,"abstract":"Hierarchical routing is used to reduce routing update costs, and clustering algorithms partition networks into multilevel cluster structures. In hierarchical networks, routing performance is greatly affected by the sizes and structures of partitioned clusters. Two existing clustering algorithms are based on the concepts of the lowest ID and the maximum degree of nodes. In this paper, we present a new clustering algorithm based on the concept of the variable degree of nodes. Our new algorithm produces clusters with the low cluster variance in size, and the number of the clusters is close to the optimal value that leads to the smallest total routing table size. The performance of the algorithm is evaluated by using simulated ad hoc networks.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"48 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116317734","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
High-speed crosstalk-free routing for optical multistage interconnection networks 用于光多级互连网络的高速无串扰路由
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284178
E. Lu, Si-Qing Zheng
{"title":"High-speed crosstalk-free routing for optical multistage interconnection networks","authors":"E. Lu, Si-Qing Zheng","doi":"10.1109/ICCCN.2003.1284178","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284178","url":null,"abstract":"Multistage interconnection networks (MINs) can be used to construct electro-optic switches. To implement crosstalk-free switching in such a switch, two I/O connecting paths cannot share a common switching element (SE). Thus, a permutation must be decomposed into partial permutations, each being routed through the switch without crosstalk. It was shown that any permutation can be decomposed into two semipermutations, and each is a maximum partial permutation realizable in one pass in an optical Benes network. However, the time complexity of existing decomposition algorithms for realizing connection requests is proportional to permutation size. In this paper, we reexamine the permutation capacity of MINs, present a simpler proof for semipermutation decomposability, and propose a parallel decomposition algorithm of logarithmic time. This algorithm is shown useful for optimally routing crosstalk-free paths in optical Benes networks in high-speed.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114749798","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}
引用次数: 17
Load-sensitive deflection routing for contention resolution in optical packet switched networks 用于光分组交换网络争用解决的负载敏感偏转路由
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284177
S. Yamano, F. Xue, S. Yoo
{"title":"Load-sensitive deflection routing for contention resolution in optical packet switched networks","authors":"S. Yamano, F. Xue, S. Yoo","doi":"10.1109/ICCCN.2003.1284177","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284177","url":null,"abstract":"Contention resolution schemes are key determinant of network performances in optical packet switched networks. This paper presents a contention resolution scheme in wavelength and space dimensions. By integrating deflection routing with wavelength conversion, this paper investigates their effects on packet-loss performance through simulation studies. In particular, we propose a load-sensitive deflection routing algorithm to compute preferred and deflection routing tables. The proposed algorithm proves effective in resolving contention and in reducing packet-loss rates. The load-sensitive deflection routing can share network resources between multiple nodes effectively and produce the same effect as increasing the number of wavelengths in each node. Simulation comparisons with other deflection routing schemes indicate that the load-sensitive deflection routing is the most effective when the load is high in some parts of a network.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133654077","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
Locality caching multiroot multigeneration routing algorithm in mobile ad hoc networks 移动自组网中的局部缓存多根多代路由算法
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284175
W. Peng, Xin Zhang, K. Makki
{"title":"Locality caching multiroot multigeneration routing algorithm in mobile ad hoc networks","authors":"W. Peng, Xin Zhang, K. Makki","doi":"10.1109/ICCCN.2003.1284175","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284175","url":null,"abstract":"A locality caching multiroot multigeneration (LCMRMG) routing algorithm for mobile ad hoc networks (MANET). The LCMRMG algorithm extends and significantly enhances a previously proposed single-root MANET routing algorithm. Hosts in a LCMRMG MANET cache the locality of network traffic routing through them. Based on the cached locality statistics, a host can calculate the estimated reduction of network traffic if it becomes a new root router and can elect to do so if the reduction exceeds a predefined threshold value.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134315881","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
Routing anomaly detection in mobile ad hoc networks 移动自组织网络中的路由异常检测
Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712) Pub Date : 2003-10-20 DOI: 10.1109/ICCCN.2003.1284145
Bo Sun, Kui Wu, U. Pooch
{"title":"Routing anomaly detection in mobile ad hoc networks","authors":"Bo Sun, Kui Wu, U. Pooch","doi":"10.1109/ICCCN.2003.1284145","DOIUrl":"https://doi.org/10.1109/ICCCN.2003.1284145","url":null,"abstract":"Intrusion detection systems (IDSs) for mobile ad hoc networks (MANETs) are necessary when we deploy MANETs in reality. In this paper, focusing on the protection of MANET routing protocols, we present a new intrusion detection agent model and utilize a Markov chain based anomaly detection algorithm to construct the local detection engine. The details of feature selection, data collection, data preprocess, Markov chain construction, classifier construction and parameter tuning are provided. Based on the routing disruption attack aimed at the dynamic source routing protocol (DSR), we study the performance of the algorithm at different mobility levels. Simulation results show that our algorithm can achieve low false positive ratio, high detection ratio, and small MTFA (mean time to the first alarm), especially when the mobility is low. Detailed analysis of simulation results is also presented.","PeriodicalId":168378,"journal":{"name":"Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092770","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}
引用次数: 69
首页 上一页 下一页 尾页
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学术官方微信