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

Differentiated bandwidth sharing with disparate flow sizes 具有不同流量大小的差异化带宽共享

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

G. V. Kessel, R. Nunez-queija, S. Borst

{"title":"Differentiated bandwidth sharing with disparate flow sizes","authors":"G. V. Kessel, R. Nunez-queija, S. Borst","doi":"10.1109/INFCOM.2005.1498528","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498528","url":null,"abstract":"We consider a multi-class queueing system operating under the discriminatory processor-sharing (DPS) discipline. The DPS discipline provides a natural approach for modeling the flow-level performance of differentiated bandwidth-sharing mechanisms. Motivated by the extreme diversity in flow sizes observed in the Internet, we examine the system performance in an asymptotic regime where the flow dynamics of the various classes occur on separate time scales. Specifically, from the perspective of a given class, the arrival and service completions of some of the competing classes (called mice) evolve on an extremely fast time scale. In contrast, the flow dynamics of the remaining classes (referred to as elephants) occur on a comparatively slow time scale. Assuming a strict separation of time scales, we obtain simple explicit expressions for various performance measures of interest, such as the distribution of the numbers of flows, mean delays, and flow throughputs. In particular, the latter performance measures are insensitive, in the sense that they only depend on the service requirement distributions through their first moments. Numerical experiments show that the limiting results provide remarkably accurate approximations in certain cases.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"10 1","pages":"2425-2435 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88132973","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}

引用次数: 31

On the interaction between overlay routing and underlay routing 论覆盖路由与底层路由的相互作用

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

Yong Liu, Honggang Zhang, W. Gong, D. Towsley

引用次数: 127

Configuring networks with content filtering nodes with applications to network security 为网络配置带有应用程序的内容过滤节点，以保证网络安全

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

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

{"title":"Configuring networks with content filtering nodes with applications to network security","authors":"M. Kodialam, T. V. Lakshman, S. Sengupta","doi":"10.1109/INFCOM.2005.1498525","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498525","url":null,"abstract":"With the rapid increase in the frequency of worm attacks, there has been significant interest in developing network based mechanisms that slow or contain worm propagation. One suggested network-based approach is the use of special content filtering nodes that examine the complete content of each packet and block traffic that contain strings matching a pre-specified set of worm signatures. To be effective, containment systems need to have fast reaction times (content filtering with the appropriate signatures must be activated very soon after the start of an attack) and need to be comprehensive in the sense that every packet routed through the network must be examined at least once. Since network-based content filtering is expensive, it is desirable to make the best use of deployable content filtering capability. This requires intelligent placement of the content filtering nodes in the network and use of appropriate network routing to maximize the carried traffic. In this paper, we study the impact of the content filtering requirement on network capacity. First, we develop an intelligent heuristic for deployment of content filtering nodes in the network. Next, given a set of deployed content filtering nodes, we develop a fully polynomial time approximation scheme (FP-TAS) that maximizes the traffic carried by the network subject to the constraint that all traffic passes through a content filtering node at least once. Simulation studies using the developed schemes show that for large networks, most of the traffic can be examined even when only 10% of the network nodes are content filtering capable.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"19 1","pages":"2395-2404 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89469046","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}

引用次数: 10

Pollution in P2P file sharing systems P2P文件共享系统中的污染

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

Jian Liang, R. Kumar, Y. Xi, K. Ross

{"title":"Pollution in P2P file sharing systems","authors":"Jian Liang, R. Kumar, Y. Xi, K. Ross","doi":"10.1109/INFCOM.2005.1498344","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498344","url":null,"abstract":"One way to combat P2P file sharing of copyrighted content is to deposit into the file sharing systems large volumes of polluted files. Without taking sides in the file sharing debate, in this paper we undertake a measurement study of the nature and magnitude of pollution in the FastTrack P2P network, currently the most popular P2P file sharing system. We develop a crawling platform which crawls the majority of the FastTrack Network's 20,000+ supernodes in less than 60 minutes. From the raw data gathered by the crawler for popular audio content, we obtain statistics on the number of unique versions and copies available in a 24-hour period. We develop an automated procedure to detect whether a given version is polluted or not, and we show that the probabilities of false positives and negatives of the detection procedure are very small. We use the data from the crawler and our pollution detection algorithm to determine the fraction of versions and fraction of copies that are polluted for several recent and old songs. We observe that pollution is pervasive for recent popular songs. We also identify and describe a number of anti-pollution mechanisms.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"27 1","pages":"1174-1185 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89531000","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}

引用次数: 357

GLIDER: gradient landmark-based distributed routing for sensor networks GLIDER:基于梯度地标的传感器网络分布式路由

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

Qing Fang, Jie Gao, L. Guibas, V. Silva, Li Zhang

{"title":"GLIDER: gradient landmark-based distributed routing for sensor networks","authors":"Qing Fang, Jie Gao, L. Guibas, V. Silva, Li Zhang","doi":"10.1109/INFCOM.2005.1497904","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497904","url":null,"abstract":"We present gradient landmark-based distributed routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating nodes. We assume that the nodes are fixed (though their geographic locations are not necessarily known), and that each node can communicate wirelessly with some of its geographic neighbors - a common scenario in sensor networks. We develop a protocol which in a preprocessing phase discovers the global topology of the sensor field and, as a byproduct, partitions the nodes into routable tiles - regions where the node placement is sufficiently dense and regular that local greedy methods can work well. Such global topology includes not just connectivity but also higher order topological features, such as the presence of holes. We address each node by the name of the tile containing it and a set of local coordinates derived from connectivity graph distances between the node and certain landmark nodes associated with its own and neighboring tiles. We use the tile adjacency graph for global route planning and the local coordinates for realizing actual inter- and intra-tile routes. We show that efficient load-balanced global routing can be implemented quite simply using such a scheme.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"17 1","pages":"339-350 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89631840","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}

引用次数: 299

A continuum approach to dense wireless networks with cooperation 协同密集无线网络的连续体方法

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

B. Sirkeci-Mergen, A. Scaglione

引用次数: 85

Provably competitive adaptive routing 可证明的竞争性自适应路由

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

B. Awerbuch, D. Holmer, H. Rubens, Robert D. Kleinberg

引用次数: 30

Dynamic reconfiguration and routing algorithms for IP-over-WDM networks with stochastic traffic 随机流量下IP-over-WDM网络的动态重构与路由算法

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

A. Brzezinski, E. Modiano

{"title":"Dynamic reconfiguration and routing algorithms for IP-over-WDM networks with stochastic traffic","authors":"A. Brzezinski, E. Modiano","doi":"10.1109/INFCOM.2005.1497912","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497912","url":null,"abstract":"We develop algorithms for joint IP layer routing and WDM logical topology reconfiguration in IP-over-WDM networks experiencing stochastic traffic. At the WDM layer, we associate a non-negligible tuning latency with WDM reconfiguration, during which time tuned transceivers cannot service backlogged data. The IP layer is modeled as a queueing system. We demonstrate that our algorithms achieve asymptotic throughput optimality by using frame-based maximum weight scheduling decisions. We study both deterministic and random frame durations. In addition to dynamically triggering WDM reconfiguration, our algorithms specify precisely how to route packets over the IP layer during the phases in which the WDM layer remains fixed. Our algorithms remain valid under a variety of optical layer constraints. We provide an analysis of the specific case of WDM networks with multiple ports per node. In order to gauge the delay properties of our algorithms, we conduct a simulation study and demonstrate an important tradeoff between WDM reconfiguration and IP layer routing. We find that multi-hop routing is extremely beneficial at low throughput levels, while single-hop routing achieves improved delay at high throughput levels. For a simple access network, we demonstrate through simulation the benefit of employing multi-hop IP layer routes.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"24 1","pages":"432-443 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73678935","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}

引用次数: 57

Online time-constrained scheduling in linear networks 线性网络的在线时间约束调度

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

J. Naor, A. Rosén, Gabriel Scalosub

{"title":"Online time-constrained scheduling in linear networks","authors":"J. Naor, A. Rosén, Gabriel Scalosub","doi":"10.1109/INFCOM.2005.1498316","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498316","url":null,"abstract":"We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by which it must arrive at its target. The model we consider is bufferless, where packets are not allowed to be buffered in nodes along their paths other than at their source. This model applies to optical networks where opto-electronic conversion is costly, and packets mostly travel through bufferless hops. The offline version of this problem was previously studied in M. Adler et al. (2002). In this paper we study the online version of the problem, where we are required to schedule the packets without knowledge of future packet arrivals. We use competitive analysis to evaluate the performance of our algorithms. We present the first deterministic online algorithms for several versions of the problem. For the problem of throughput maximization, where all packets have uniform weights, we give an algorithm with a logarithmic competitive ratio, and present some lower bounds. For other weight functions, we show algorithms that achieve optimal competitive ratios. We complete our study with several experimental results.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"96 1","pages":"855-865 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79465401","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

Minimum-color path problems for reliability in mesh networks 网状网络可靠性的最小颜色路径问题

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

Shengli Yuan, Saket Varma, J. Jue

{"title":"Minimum-color path problems for reliability in mesh networks","authors":"Shengli Yuan, Saket Varma, J. Jue","doi":"10.1109/INFCOM.2005.1498549","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498549","url":null,"abstract":"In this work, we consider the problem of maximizing the reliability of connections in mesh networks against failure scenarios in which multiple links may fail simultaneously. We consider the single-path connection problem as well as multiple-path (protected) connection problems. The problems are formulated as minimum-color path problems, where each link is associated with one or more colors, and each color corresponds to a given failure event Thus, when a certain color fails, all links which include that color will fail. In a single-path problem, by minimizing the number of colors on the path, the failure probability of the path can be minimized if all colors have the same probability of causing failures. In the case of two paths, where one path is a protection path, if all colors have the same probability of causing failures, the problem becomes that of finding two link-disjoint paths which either have a minimum total number of colors, or which have a minimum number of overlapping colors. By minimizing the total number of colors, the probability that a failure will occur on either of the paths is minimized. On the other hand, by minimizing the number of overlapping colors, the probability that a single failure event will cause both paths to fail simultaneously is minimized. The problems are proved to be NP-complete, and ILP formulations are developed. Heuristic algorithms are proposed for larger instances of the problems, and the heuristics are evaluated through simulation.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"84 1","pages":"2658-2669 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81220917","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}

引用次数: 93