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

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.最新文献

筛选
英文 中文
Computing delay constrained paths from one source to single/all destinations 计算从一个源到单个/所有目的地的延迟约束路径
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523810
G. Feng
{"title":"Computing delay constrained paths from one source to single/all destinations","authors":"G. Feng","doi":"10.1109/ICCCN.2005.1523810","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523810","url":null,"abstract":"Delay-constrained least cost (DCLC) path problem is a typical delay sensitive quality of service (QoS) routing problem. In this paper, we provide an explicit expression of the time complexity of a previously proposed heuristic NR-DCLC when delay and cost are integers. The expression indicates it compares favorably with other heuristics. We further describe a heuristic NR-DCLC-1toN to compute the DCLC paths from one source to all destinations satisfying the delay constraint. Simulations demonstrate that NR-DCLC-1toN can always find delay constrained paths with lower costs than the delay scaling algorithm (DSA), which is so far the best heuristic for such problem. Even though NR-DCLC-1toN needs higher execution time than DSA in some cases, it runs much faster than DSA in many other cases such as when the delay constraint has to be strictly guaranteed or when the delay and cost are distributed on large intervals.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133934455","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
FairMAC: fair sharing of multi-access channels in WLAN hotspots FairMAC: WLAN热点中多址通道的公平共享
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523822
P. Sinha, Y. Shavitt, R. Ramjee, D. Raz, S. Kasera
{"title":"FairMAC: fair sharing of multi-access channels in WLAN hotspots","authors":"P. Sinha, Y. Shavitt, R. Ramjee, D. Raz, S. Kasera","doi":"10.1109/ICCCN.2005.1523822","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523822","url":null,"abstract":"We identify two typical problems in WLAN hotspots that result in unbounded unfairness between upstream and downstream flows. The first unfairness problem arises due to the uniformity of the MAC layer protocol at the access point (AP) and user nodes that result in equal share to the AP and the user nodes but not to the individual flows. The second unfairness problem arises due to the inability of the physical layer to distinguish frame errors due to hidden terminal based collisions and frame errors due to poor signal strength. We present FairMAC, a deployable solution that addresses these unfairness problems without requiring a change to the 802.11 protocol. Thus, our solution is immediately deployable in the millions of currently operational hotspots. We evaluate the performance of our protocol using simulations and a prototype implementation. We show that FairMAC provides fair access to all the flows regardless whether they are originating at the AP or a host.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"103 49","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131914096","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
A priority forwarding technique for efficient and fast flooding in wireless ad hoc networks 无线自组织网络中一种高效快速泛洪的优先级转发技术
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523854
Kihwan Kim, Ying Cai, Wallapak Tavanapong
{"title":"A priority forwarding technique for efficient and fast flooding in wireless ad hoc networks","authors":"Kihwan Kim, Ying Cai, Wallapak Tavanapong","doi":"10.1109/ICCCN.2005.1523854","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523854","url":null,"abstract":"In this paper, we propose a new technique, called priority forwarding, for efficient and fast flooding operations in wireless ad hoc networks. The new scheme is featured by dynamic delay and priority checking. The former feature allows a host to wait as long as possible to refrain from retransmission, minimizing retransmission overhead. The priority checking feature, on the other hand, allows a flooding packet to be propagated as quickly as possible, keeping flooding latency low. Unlike many location-aided flooding techniques, priority forwarding requires each host to know only the distance of its 1-hop neighbors, instead of their exact locations. Therefore, it has low implementation cost. For performance evaluation, we compare priority forwarding with some existing techniques using simulation. Our results show that under most scenarios, the new technique performs many times better in reducing packet retransmissions and flooding latency.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130108460","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
Heterogeneous QoS multicast in Diffserv-like networks 类diffserv网络中的异构QoS组播
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523828
Sai-Sudhir Anantha-Padmanaban, G. Manimaran, P. Mohapatra
{"title":"Heterogeneous QoS multicast in Diffserv-like networks","authors":"Sai-Sudhir Anantha-Padmanaban, G. Manimaran, P. Mohapatra","doi":"10.1109/ICCCN.2005.1523828","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523828","url":null,"abstract":"Multicasting in Diffserv networks is a challenging problem due to the architectural conflicts between them, namely, stateful vs. stateless core. In this paper, we assume an edge-based multicast (EBM) model wherein the multicast tree is constructed such that the branching occurs only at the edge routers. We propose an algorithm to solve the problem of dynamic member join/leave in heterogeneous QoS multicasting under EBM model. We formally state the problem and propose an algorithm for it, which is optimal when the constraint on the member join/leave requires that there can be no service disruption for on-tree nodes. We then evaluate the performance of our algorithm with respect to a static multicast tree construction heuristic and a source-based shortest path algorithm using \"tree QoS cost\" as a primary metric. Our studies show that the proposed algorithm achieves good performance in terms of tree QoS cost, time taken for member join/leave, and number of service disruptions with acceptable storage overhead.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"37 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120883736","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
Bounds on throughput capacity of MANETs manet的吞吐量容量限制
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523950
Oualid Chaker, J. Conan
{"title":"Bounds on throughput capacity of MANETs","authors":"Oualid Chaker, J. Conan","doi":"10.1109/ICCCN.2005.1523950","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523950","url":null,"abstract":"The simultaneous transmissions in ad hoc networks limits its per-user rate. So it is imperative to understand the fundamental capacity performance limits, in terms of throughput and delay, of ad-hoc wireless networks, with the goal of designing resource allocation (power control, medium access, routing...) algorithms that allow to reach these performance limits. A new line of research has been initiated which is the asymptotic throughput of dense wireless networks, it has been established as a function of the number of nodes in the network.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116456619","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
Constructing minimum cost dynamic multicast trees under delay constraint 构造时延约束下的最小代价动态组播树
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523827
Min Yang, Yuanyuan Yang
{"title":"Constructing minimum cost dynamic multicast trees under delay constraint","authors":"Min Yang, Yuanyuan Yang","doi":"10.1109/ICCCN.2005.1523827","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523827","url":null,"abstract":"Multicast is an efficient way for group communication over the Internet. The performance of multicast relies greatly on the multicast tree constructed among the group members. Constructing a multicast tree spanning a set of group members with minimum cost is called Steiner tree problem which is a well-known NP-hard problem. Existing heuristic algorithms can build such a Steiner tree statically when the group members are known in advance. However, in many multicast tree dynamically. In addition, QoS is becoming a more important issue in multicast applications, and many applications, pose a tight bound on end-to-end delay. In this paper, we design a heuristic algorithm which can construct a delay constrained minimum cost multicast tree dynamically. Our algorithm can add or remove a group number without rerouting the path between the source and other group members. The algorithm not only avoids packet loss but also saves network bandwidth. Our algorithm guarantees that the end-to-end delay between the source and any group member is bounded with a threshold. Simulation results show that the algorithm achieves a good balance between the cost of a multicast tree and the time of the construction.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784302","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
Achieving maximum throughput with a minimum number of label switched paths in MPLS networks 在MPLS网络中，以最少的标签交换路径实现最大的吞吐量
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523841
Hua Wang, Jianyu Lou, Yu Chen, Ya-Min Sun, Xiaojun Shen
{"title":"Achieving maximum throughput with a minimum number of label switched paths in MPLS networks","authors":"Hua Wang, Jianyu Lou, Yu Chen, Ya-Min Sun, Xiaojun Shen","doi":"10.1109/ICCCN.2005.1523841","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523841","url":null,"abstract":"MPLS (multi-protocol label switching) networks allow multiple LSPs (label-switched paths) be established from a source to a destination to satisfy throughput required by an application. Given a MPLS network, where each link is associated with a maximum available bandwidth, a fundamental traffic engineering problem is how we can find minimum number of paths to achieve the maximum throughput. Optimally solving this problem can save huge amount of valuable network resources including available label space and reduce management complexity. This paper proves that finding a minimal number of LSPs is an NP-hard problem. To deal with this problem, we have studied four approximation algorithms. We found from simulations that the average number of paths produced by all these algorithms grows quite slowly when the network grows large. Moreover, the two algorithms, topological-sort-based maximum-path algorithm and greedy-based maximum-edge algorithm perform better than other algorithms. Between these two algorithms, the greedy-based maximum-edge algorithm is more time-efficient while keeps comparable performance.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466081","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
Improvement research on transmission mechanism of adaptive forward error correction code 自适应前向纠错码传输机制的改进研究
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523948
Ying Xiong, Yu Zhang, X. Jin
{"title":"Improvement research on transmission mechanism of adaptive forward error correction code","authors":"Ying Xiong, Yu Zhang, X. Jin","doi":"10.1109/ICCCN.2005.1523948","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523948","url":null,"abstract":"Based on the analysis of FEC/ARQ transmission mechanism, we propose a novel transmission mechanism of AFEC (adaptive forward error correction) code in this paper in order to improve the jitter performance on the client end. The new mechanism modifies the method of information exchanging between the server end and client end. In the FEC/ARQ mechanism, the server end does not transmit data until it receives the feedback message about the acceptance status of the previously transmitted data, which badly affects the jitter performance on the client end. The new mechanism adopts 2-level AFEC code, which allows the server to adjust the FEC redundancy and sending rate in accordance with the control messages feed back by the client and even in the case of the lack of the feedback message, the server using the new mechanism does not stop sending data. Based on the network simulator 2 platforms, we simulate FEC/ARQ and AFEC respectively and both mechanisms are experimented on the same working condition and they are tested for 3 different conditions. The comparison between the NS2 simulation results of these two schemes proves that the newly proposed AFEC transmission mechanism can improve the jitter performance on the client end.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127012527","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
Stochastic behavior of random constant scanning worms 随机恒扫描蠕虫的随机行为
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523881
K. Rohloff, T. Başar
{"title":"Stochastic behavior of random constant scanning worms","authors":"K. Rohloff, T. Başar","doi":"10.1109/ICCCN.2005.1523881","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523881","url":null,"abstract":"This paper discusses modeling and simulation issues associated with the stochastic behavior of a special type of a computer worm called a random constant scanning (RCS) worm. Although these worms propagate by randomly scanning network addresses to find hosts that are susceptible to infection, traditional RCS worm models are fundamentally deterministic. A density-dependent Markov jump process model for RCS worms is presented and analyzed. Conditions are shown for when worm models can safely ignore some stochastic properties of RCS worm propagation. A computationally simple hybrid deterministic/stochastic model for the observed scanning behavior on a local network due to the global propagation of an RCS scanning worm is also presented and discussed.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"405 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484570","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}
引用次数: 56
Impact of lossy links on performance of multihop wireless networks 有损链路对多跳无线网络性能的影响
Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI: 10.1109/ICCCN.2005.1523872
Yuxi Li, J. Harms, R. Holte
{"title":"Impact of lossy links on performance of multihop wireless networks","authors":"Yuxi Li, J. Harms, R. Holte","doi":"10.1109/ICCCN.2005.1523872","DOIUrl":"https://doi.org/10.1109/ICCCN.2005.1523872","url":null,"abstract":"Multihop wireless networks have unique features such as lossy links and interference. Both interference and lossy links affect the maximum achievable throughput of a network. Some wireless networks have energy constraints. Lossy links also affect energy efficiency due to retransmissions and broadcasting. We investigate the impact of lossy links on maximum achievable throughput and minimax energy utilization. These can be modeled as linear programming optimization problems. We give optimal solutions for both flow-based and destination-based routing. Experiments show that lossy links do have significant impact on the maximum achievable throughput. There are cases where a network can only achieve half of the throughput of the corresponding lossless network. The results show less significant impact of loss on energy efficiency. In some cases, the loss may be advantageous for energy efficiency, since the energy consumption may be reduced due to the loss of broadcasting messages. Experiments also show the significant impact of overhearing on energy efficiency.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116936680","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}
引用次数: 24
首页 上一页 下一页 尾页
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学术官方微信