Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.最新文献_第6页

A novel analytical model for electronic and optical switches with shared buffer 一种新的共享缓冲器电子光开关解析模型

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1497911

Zhenghao Zhang, Yuanyuan Yang

{"title":"A novel analytical model for electronic and optical switches with shared buffer","authors":"Zhenghao Zhang, Yuanyuan Yang","doi":"10.1109/INFCOM.2005.1497911","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497911","url":null,"abstract":"Switches with shared buffer have lower packet loss probabilities than other types of switches when the sizes of the buffers are the same. In the past, the performance analysis for electronic shared buffer switches has been carried out extensively. However, due to the strong dependencies of the output queues in the buffer, it is very difficult to find a good analytical model. Existing models are either accurate but have exponential complexities or not very accurate. In this paper, we propose a novel analytical model called the aggregation model for switches with shared buffer. This model can be used for analyzing both electronic and optical switches, and has perfect accuracies under all tested conditions and has polynomial time complexity. It is based on the idea of induction: first find the behavior of 2 queues, then aggregate them into one block; then find the behavior of 3 queues while regarding 2 of the queues as one block, then aggregate the 3 queues into one block; then aggregate 4 queues and so on. When a sufficient number of queues have been aggregated, the behavior of the entire switch is found. We believe that the new model represents the best analytical model for shared buffer switches so far.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"128 1","pages":"420-431 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88344306","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

On optimal partitioning of realtime traffic over multiple paths 多路径实时流量的最优划分

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498519

S. Mao, S. Panwar, Yiwei Thomas Hou

{"title":"On optimal partitioning of realtime traffic over multiple paths","authors":"S. Mao, S. Panwar, Yiwei Thomas Hou","doi":"10.1109/INFCOM.2005.1498519","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498519","url":null,"abstract":"Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are (1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and (2) how to select paths. In this paper, we present an analytical framework for the optimal partitioning of realtime multimedia traffic that minimizes the total end-to-end delay. Specifically, we formulate optimal traffic partitioning as a constrained optimization problem using deterministic network calculus, and derive its closed form solution. Compared with previous work, our scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, we can choose a minimal subset to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"75 1","pages":"2325-2336 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85987770","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}

引用次数: 29

Compact neighbor discovery: a bandwidth defense through bandwidth optimization 紧凑邻居发现:通过带宽优化实现带宽防御

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498554

Pars Mutaf, C. Castelluccia

{"title":"Compact neighbor discovery: a bandwidth defense through bandwidth optimization","authors":"Pars Mutaf, C. Castelluccia","doi":"10.1109/INFCOM.2005.1498554","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498554","url":null,"abstract":"We present a stateless defense against the neighbor discovery denial-of-service (ND-DoS) attack in IPv6. The ND-DoS attack consists of remotely flooding a target subnet with bogus packets destined for random interface identifiers; a different one for each malicious packet. The 128-bit IPv6 address reserves its 64 low-order bits for the interface ID. Consequently, the malicious packets are very likely to fall on previously unresolved addresses and the target access router (or leaf router) is obligated to resolve these addresses by sending neighbor solicitation packets. Neighbor solicitation packets are link layer multicast (or broadcast), and hence also forwarded by bridges. As a consequence, the attack may consume important bandwidth in subnets with wireless bridges, or access points. This problem is particularly important in the presence of mobile IPv6 devices that expect incoming sessions from the Internet. In this case, address resolution is crucial for the access router to reliably deliver incoming sessions to idle mobile devices with unknown MAC addresses. We propose a novel neighbor solicitation technique using Bloom filters. Multiple IPv6 addresses (bogus or real) that are waiting in the access router's address resolution queue are compactly represented using a Bloom filter. By broadcasting a single neighbor solicitation message that carries the Bloom filter, multiple IPv6 addresses are concurrently solicited. Legitimate neighbor solicitation triggering packets are not denied service. An on-link host can detect its address in the received Bloom filter and return its MAC address to the access router. A bandwidth gain around 40 can be achieved in all cells of the target subnet. This approach that we call compact neighbor discovery (CND) is the first bandwidth DoS defense that we are aware of to employ a bandwidth optimization.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"24 1","pages":"2711-2719 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86687343","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}

引用次数: 14

Multipath routing for multiple description video in wireless ad hoc networks 无线自组织网络中多描述视频的多路径路由

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1497939

S. Mao, Yiwei Thomas Hou, Xiaolin Cheng, H. Sherali, S. Midkiff

{"title":"Multipath routing for multiple description video in wireless ad hoc networks","authors":"S. Mao, Yiwei Thomas Hou, Xiaolin Cheng, H. Sherali, S. Midkiff","doi":"10.1109/INFCOM.2005.1497939","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497939","url":null,"abstract":"As developments in wireless ad hoc networks continue, there is an increasing expectation with regard to supporting content-rich multimedia communications (e.g., video) in such networks, in addition to simple data communications. The recent advances in multiple description (MD) video coding have made it highly suitable for multimedia applications in such networks. In this paper, we study the important problem of multipath routing for MD video in wireless ad hoc networks. We follow an application-centric cross-layer approach and formulate an optimal routing problem that minimizes the application layer video distortion. We show that the optimization problem has a highly complex objective function and an exact analytic solution is not obtainable. However, we find that a meta-heuristic approach such as genetic algorithms (GAs) is eminently effective in addressing this type of complex cross-layer optimization problems. We provide a detailed solution procedure for the GA-based approach, as well as a tight lower bound for video distortion. We use numerical results to demonstrate the superior performance of the GA-based approach and compare it to several other approaches. Our efforts in this work provide an important methodology for addressing complex cross-layer optimization problems, particularly those involving application and network layers.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"18 1","pages":"740-750 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81328243","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}

引用次数: 77

Minimum energy accumulative routing in wireless networks 无线网络中的最小能量累积路由

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498466

Jiangzhuo Chen, L. Jia, Xin Liu, G. Noubir, Ravi Sundaram

{"title":"Minimum energy accumulative routing in wireless networks","authors":"Jiangzhuo Chen, L. Jia, Xin Liu, G. Noubir, Ravi Sundaram","doi":"10.1109/INFCOM.2005.1498466","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498466","url":null,"abstract":"In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially overheard signals of previous transmissions for the same packet are used to decode it using a maximal ratio combiner technique [J.G. Proakis, 2001]. Therefore, additional energy saving can be achieved over traditional energy efficient routing. The idea of accumulative relay originates from the study of relay channel in information theory with a main focus on network capacity. It has been independently applied to minimum-energy broadcasting in L.G. Manish Agrawal et al. (2004), I. Maric and R. Yates (2002). We formulate the minimum energy accumulative routing problem (MEAR) and study it. We obtain hardness of approximation results counterbalanced with good heuristic solutions which we validate using simulations. Without energy accumulation, the classic shortest path (SP) algorithm finds the minimum energy path for a source-destination pair. However, we show that with energy accumulation, the SP can be arbitrarily bad. We turn our attention to heuristics and show that any optimal solution of MEAR can be converted to a canonical form - wave path. Armed with this insight, we develop a polynomial time heuristic to efficiently search over the space of all wavepaths. Simulation results show that our heuristic can provide more than 30% energy saving over minimum energy routing without accumulative relay. We also discuss the implementation issues of such a scheme.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"24 1","pages":"1875-1886 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84364941","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}

引用次数: 43

Capacity allocation and routing of locally restorable bandwidth guaranteed connections 本地可恢复带宽保证连接的容量分配和路由

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498552

R. Bhatia, M. Kodialam, T. V. Lakshman, S. Sengupta

{"title":"Capacity allocation and routing of locally restorable bandwidth guaranteed connections","authors":"R. Bhatia, M. Kodialam, T. V. Lakshman, S. Sengupta","doi":"10.1109/INFCOM.2005.1498552","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498552","url":null,"abstract":"An important feature of MPLS networks is local restoration where detour paths are set-up a priori. The detour is such that failed links or nodes can be bypassed locally from the first node that is upstream from the failures. This local bypass activation from the first detection point for failures permits much faster recovery than end-to-end path based mechanisms that require failure information to propagate to the network edges. However, local restoration of bandwidth guaranteed connections can be expensive in the additional network capacity needed. Hence, it is important to minimize and share restoration capacity. The problem of routing with local restoration requirements has been studied previously in a dynamic on-line setting. However, there are no satisfactory algorithms for the problem of pre-provisioning fast restorable connections when the aggregate traffic demands are known (as would be the case when a set of routers are to be interconnected over an optical network or for pre-provisioned ATM over MPLS overlays). The contribution of this paper is a fast combinatorial approximation algorithm for maximizing throughput when the routed traffic is required to be locally restorable. To the best of our knowledge, this is the first combinatorial algorithm for the problem with a performance guarantee. Our algorithm is a fully polynomial time approximation scheme (FPTAS), i.e., for any given /spl epsi/>0, it guarantees (1+/spl epsi/)-factor closeness to the optimal solution, and runs in time polynomial in the network size and 1//spl epsi/. We compare the throughput of locally restorable routing with that of unprotected routing and 1+1-dedicated path protection on representative ISP topologies.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"152 1","pages":"2691-2701 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84803057","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

Designing wireless radio access networks for third generation cellular networks 第三代蜂窝网络无线接入网络设计

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1497880

T. Bu, M. Chan, R. Ramjee

{"title":"Designing wireless radio access networks for third generation cellular networks","authors":"T. Bu, M. Chan, R. Ramjee","doi":"10.1109/INFCOM.2005.1497880","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497880","url":null,"abstract":"In third generation (3G) cellular networks, base stations are connected to base station controllers by point-to-point (usually T1/E1) links. However, today's T1/E1 based buck haul network is not a good match for next generation wireless networks because symmetric T1s is not an efficient way to carry bursty and asymmetric data traffic. In this paper, we propose designing an IEEE 802.16-based wireless radio access network to carry the traffic from the base station to the radio network controller. 802.16 has several characteristics that make it a better match for 3G radio access networks including its support for time division duplex mode that supports asymmetry efficiently. In this paper, we tackle the following question; given a layout of base stations and base station controllers, how do we design the topology of the 802.16 radio access network connecting the base stations to the base station controller that minimizes the number of 802.16 links used while meeting the expected demands of traffic from/to the base stations? We make three contributions: we first show that finding the optimal solution to the problem is NP-hard. We then provide heuristics that perform close to the optimal solution. Finally, we address the reliability issue of failure of 802.16 links or nodes by designing algorithms to create topologies that can handle single failures effectively.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"27 1","pages":"68-78 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79297521","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}

引用次数: 27

Network overlay construction under limited end-to-end reachability 有限端到端可达性下的网络覆盖结构

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498488

Wenjie Wang, Cheng Jin, S. Jamin

引用次数: 23

Strategyproof mechanisms for dynamic tree formation in overlay networks 覆盖网络中动态树形成的防策略机制

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498489

S. Yuen, Baochun Li

引用次数: 33

dPAM: a distributed prefetching protocol for scalable asynchronous multicast in P2P systems dPAM:用于P2P系统中可扩展异步多播的分布式预取协议

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498341

Abhishek Sharma, Azer Bestavros, I. Matta

引用次数: 65