Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488124
R. Gaeta, M. Sereno
In this paper we analyze the performance of generalized flooding search strategies in two-tier peer-to-peer networks by means of random graphs. In particular, the connections between top and bottom-level peers are modeled as a bipartite random graph while the overlay network used by top-level peers to forward queries is modeled as a generalized random graph. To assign realistic values to the input model parameters we developed a distributed crawler of the Gnutella network to obtain snapshots of the application topology at both levels; to validate the model predictions we conducted simulation experiments on these snapshots. We exploited the model to show how generalizations of the classical flooding technique can help to design search strategies that meet pre-defined requirements on the hit probability and the average number of query messages exchanged during a search operation.
{"title":"Performance of search strategies in two-tier peer-to-peer networks","authors":"R. Gaeta, M. Sereno","doi":"10.1109/ITNEWS.2008.4488124","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488124","url":null,"abstract":"In this paper we analyze the performance of generalized flooding search strategies in two-tier peer-to-peer networks by means of random graphs. In particular, the connections between top and bottom-level peers are modeled as a bipartite random graph while the overlay network used by top-level peers to forward queries is modeled as a generalized random graph. To assign realistic values to the input model parameters we developed a distributed crawler of the Gnutella network to obtain snapshots of the application topology at both levels; to validate the model predictions we conducted simulation experiments on these snapshots. We exploited the model to show how generalizations of the classical flooding technique can help to design search strategies that meet pre-defined requirements on the hit probability and the average number of query messages exchanged during a search operation.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127165772","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488150
M. Rahmani, Rainer Steffen, Ktawut Tappayuthpijarn, Eckehard Steinbach, Giuseppe Giordano
In-vehicle audio and video communication has recently received considerable attention in the automotive industry. First, because of the increasing number of audio and video consumer electronic devices and the requirement to integrate them in the car. Second, because of the rapid growing of realtime audio and video based driver assistance systems. So far, the interconnection of in-vehicle stream oriented devices has been performed by different and automotive specific network systems with limited transmission capacities. IP over Ethernet provides good conditions for audio and video streaming by offering high transmission capacities. In order to design an appropriate IP/Ethernet network for audio and video communication in the car, the selection of the right network topology is essential. In this work, several network topologies are compared by their Quality of Service (QoS) performance and production cost. Appropriate topologies are proposed.
{"title":"Performance analysis of different network topologies for in-vehicle audio and video communication","authors":"M. Rahmani, Rainer Steffen, Ktawut Tappayuthpijarn, Eckehard Steinbach, Giuseppe Giordano","doi":"10.1109/ITNEWS.2008.4488150","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488150","url":null,"abstract":"In-vehicle audio and video communication has recently received considerable attention in the automotive industry. First, because of the increasing number of audio and video consumer electronic devices and the requirement to integrate them in the car. Second, because of the rapid growing of realtime audio and video based driver assistance systems. So far, the interconnection of in-vehicle stream oriented devices has been performed by different and automotive specific network systems with limited transmission capacities. IP over Ethernet provides good conditions for audio and video streaming by offering high transmission capacities. In order to design an appropriate IP/Ethernet network for audio and video communication in the car, the selection of the right network topology is essential. In this work, several network topologies are compared by their Quality of Service (QoS) performance and production cost. Appropriate topologies are proposed.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960682","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488154
M. Petracca, R. Birke, A. Bianco
Increasing attention has been recently devoted to software routers based on off-the-shelf hardware and open-source operating systems running on personal computer (PC) architectures. Today's high-end PCs PCI shared buses fit into the multi-gigabit-per-second routing segment, for a price much lower than that of commercial routers. However, commercially available Network Interface Cards (NICs) lack programmability, and require not only packets to cross the PCI bus twice, but also to process them in software by the operating system (OS), reducing routing performance. In this paper we discuss the design of an FPGA-based NIC that permits to overcome the limitations of commercial NICs and provide a detailed description of its implementation.
{"title":"HERO: High-speed enhanced routing operation in software routers NICs","authors":"M. Petracca, R. Birke, A. Bianco","doi":"10.1109/ITNEWS.2008.4488154","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488154","url":null,"abstract":"Increasing attention has been recently devoted to software routers based on off-the-shelf hardware and open-source operating systems running on personal computer (PC) architectures. Today's high-end PCs PCI shared buses fit into the multi-gigabit-per-second routing segment, for a price much lower than that of commercial routers. However, commercially available Network Interface Cards (NICs) lack programmability, and require not only packets to cross the PCI bus twice, but also to process them in software by the operating system (OS), reducing routing performance. In this paper we discuss the design of an FPGA-based NIC that permits to overcome the limitations of commercial NICs and provide a detailed description of its implementation.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117031814","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488140
H. Badis
Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). This paper addresses the problem of effective multicast tree construction for interactive audiovisual communication. QoS metrics (bandwidth, delay, etc.) on links of some networks are not symmetric as in wireless ad hoc networks. So, the network is modelled as a directed graph. We associate an arc cost, an arc bandwidth, an arc delay, etc., with each arc in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so the QoS metrics on the path from source to each destination are bounded. Since the problem of computing the optimal constrained multicast tree is NP-complete, we present a quasipolynomial-time and deterministic approximation algorithm. Experimental results through simulations show that the performance of the heuristic is near optimal.
{"title":"A quasipolynomial-time and deterministic source-based heuristic for multicasting multimedia information","authors":"H. Badis","doi":"10.1109/ITNEWS.2008.4488140","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488140","url":null,"abstract":"Many real-time applications, such as video conferencing, require the transmission of flows from a sender to multiple receivers subject to Quality of Service (QoS) delivery constraints (e.g. bounded delay). This paper addresses the problem of effective multicast tree construction for interactive audiovisual communication. QoS metrics (bandwidth, delay, etc.) on links of some networks are not symmetric as in wireless ad hoc networks. So, the network is modelled as a directed graph. We associate an arc cost, an arc bandwidth, an arc delay, etc., with each arc in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so the QoS metrics on the path from source to each destination are bounded. Since the problem of computing the optimal constrained multicast tree is NP-complete, we present a quasipolynomial-time and deterministic approximation algorithm. Experimental results through simulations show that the performance of the heuristic is near optimal.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129956159","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488135
J. Triay, C. Cervelló-Pastor
Optical burst switching (OBS) has been proposed as a future high-speed switching technology for Internet Protocol (IP) networks that may be able to efficiently utilize extremely high capacity links without the need for optical-electronic (O/E) conversions at intermediate nodes. Among its benefits of supporting statistical multiplexing at a rational granularity, OBS still gives poor performance in terms of burst drop probability. In an Optical Burst Switched network, the existence of highly congested links could lead to unacceptable performance for the entire network, causing quality of service (QoS) degradation to flows inserted into the network. In this paper we propose a Multi- Spanning Tree architecture that improves QoS management by increasing the efficiency in the wavelength assignment process. The new protocol uses wavelength spanning trees on demand depending on the QoS constraints demanded by inserted traffics. Moreover, the protocol avoids burst overlapping on each edge of the spanning trees, while at the same time, permitting the reutilization of lambda assignments between nodes contained in the same branch. Therefore, the protocol allows traffic aggregation from many nodes into a single branch, improving efficiency and link utilization. We take a traffic engineering approach to branch selection with the objective of balancing the traffic across the network links to reduce congestion and to improve overall performance. In this paper, the architecture, the design of the protocol and some simulation results are presented.
{"title":"QoS multi-spanning tree for optical burst switching","authors":"J. Triay, C. Cervelló-Pastor","doi":"10.1109/ITNEWS.2008.4488135","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488135","url":null,"abstract":"Optical burst switching (OBS) has been proposed as a future high-speed switching technology for Internet Protocol (IP) networks that may be able to efficiently utilize extremely high capacity links without the need for optical-electronic (O/E) conversions at intermediate nodes. Among its benefits of supporting statistical multiplexing at a rational granularity, OBS still gives poor performance in terms of burst drop probability. In an Optical Burst Switched network, the existence of highly congested links could lead to unacceptable performance for the entire network, causing quality of service (QoS) degradation to flows inserted into the network. In this paper we propose a Multi- Spanning Tree architecture that improves QoS management by increasing the efficiency in the wavelength assignment process. The new protocol uses wavelength spanning trees on demand depending on the QoS constraints demanded by inserted traffics. Moreover, the protocol avoids burst overlapping on each edge of the spanning trees, while at the same time, permitting the reutilization of lambda assignments between nodes contained in the same branch. Therefore, the protocol allows traffic aggregation from many nodes into a single branch, improving efficiency and link utilization. We take a traffic engineering approach to branch selection with the objective of balancing the traffic across the network links to reduce congestion and to improve overall performance. In this paper, the architecture, the design of the protocol and some simulation results are presented.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121950476","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488162
R. Sadre, B. Haverkort
A typical step in the model-based evaluation of communication systems is to fit measured data to analytically tractable distributions. Due to the increased speed of today's networks, even basic measurements, such as logging the requests at a Web server, can quickly generate large data traces with millions of entries. Employing complex fitting algorithms on such traces can take a significant amount of time. In this paper, we focus on the Expectation Maximization-based fitting of heavy- tailed distributed data to hyper-exponential distributions. We present a data aggregation algorithm which accelerates the fitting by several orders of magnitude. The employed aggregation algorithm has been derived from a sampling stratification technique and adapts dynamically to the distribution of the data. We illustrate the performance of the algorithm by applying it to empirical and artificial data traces.
{"title":"Fitting heavy-tailed HTTP traces with the new stratified EM-algorithm","authors":"R. Sadre, B. Haverkort","doi":"10.1109/ITNEWS.2008.4488162","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488162","url":null,"abstract":"A typical step in the model-based evaluation of communication systems is to fit measured data to analytically tractable distributions. Due to the increased speed of today's networks, even basic measurements, such as logging the requests at a Web server, can quickly generate large data traces with millions of entries. Employing complex fitting algorithms on such traces can take a significant amount of time. In this paper, we focus on the Expectation Maximization-based fitting of heavy- tailed distributed data to hyper-exponential distributions. We present a data aggregation algorithm which accelerates the fitting by several orders of magnitude. The employed aggregation algorithm has been derived from a sampling stratification technique and adapts dynamically to the distribution of the data. We illustrate the performance of the algorithm by applying it to empirical and artificial data traces.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237782","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488142
P. Barlet-Ros, J. Sanjuàs-Cuxart, J. Solé-Pareta, G. Iannaccone
Building robust network monitoring applications is hard given the unpredictable nature of network traffic and continuous growth of link speeds, data rates and complexity of traffic analysis tasks. Effective resource management techniques are now a basic requirement for this class of applications, which have to deal inevitably with the effects of extreme overload situations during their normal operation. In this paper, we present in detail the problems involved in the management of system resources in network monitoring and describe the design of a load shedding scheme that can efficiently handle extreme overload situations by gracefully degrading the accuracy of monitoring applications. Our method controls the resources allocated to each application by dynamically adjusting the sampling rate based on an online prediction model of the system resource requirements. We present experimental evidence of the robustness and performance of our system using real traffic traces and injecting synthetic traffic anomalies.
{"title":"Robust resource allocation for online network monitoring","authors":"P. Barlet-Ros, J. Sanjuàs-Cuxart, J. Solé-Pareta, G. Iannaccone","doi":"10.1109/ITNEWS.2008.4488142","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488142","url":null,"abstract":"Building robust network monitoring applications is hard given the unpredictable nature of network traffic and continuous growth of link speeds, data rates and complexity of traffic analysis tasks. Effective resource management techniques are now a basic requirement for this class of applications, which have to deal inevitably with the effects of extreme overload situations during their normal operation. In this paper, we present in detail the problems involved in the management of system resources in network monitoring and describe the design of a load shedding scheme that can efficiently handle extreme overload situations by gracefully degrading the accuracy of monitoring applications. Our method controls the resources allocated to each application by dynamically adjusting the sampling rate based on an online prediction model of the system resource requirements. We present experimental evidence of the robustness and performance of our system using real traffic traces and injecting synthetic traffic anomalies.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134214962","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488157
A. Bianco, A. Scicchitano
Multi-chip scheduler implementation in IQ switches are suited to reduce the hardware complexity in very large, high-speed, switches. However, this implies introducing a RTTs (Round Trip Time) among input and output selectors used to determine a matching due to inter-chip latency. This delay requires modifications to scheduling algorithms to allow a fully distributed implementation while keeping good performance. We propose a novel multicast scheduler, named IMRR, an extension of a previously proposed multicast scheduling algorithm named mRRM, making it suitable to a multi-chip implementation, and examine its performance by simulation.
{"title":"Multi-chip multicast schedulers in input-queued switches","authors":"A. Bianco, A. Scicchitano","doi":"10.1109/ITNEWS.2008.4488157","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488157","url":null,"abstract":"Multi-chip scheduler implementation in IQ switches are suited to reduce the hardware complexity in very large, high-speed, switches. However, this implies introducing a RTTs (Round Trip Time) among input and output selectors used to determine a matching due to inter-chip latency. This delay requires modifications to scheduling algorithms to allow a fully distributed implementation while keeping good performance. We propose a novel multicast scheduler, named IMRR, an extension of a previously proposed multicast scheduling algorithm named mRRM, making it suitable to a multi-chip implementation, and examine its performance by simulation.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116934491","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488137
V. López, C. Cárdenas, J.A. Hernandez, J. Aracil, M. Gagnaire
Backbone networks are migrating to IP over WDM architectures. In such multi-layer network configurations, it is necessary to combine efficiently the resources of both layers in order to provide enhanced quality of service (QoS) to the end-users. In the context of existing IP networks, flow-aware networking (FAN) has been proposed in order to provide QoS guarantees to multiplexed IP flows within an IP router. FAN is based on implicit admission control and per-flow scheduling. In this paper, we propose a new node architecture that extends the FAN concept to IP over WDM overlayed networks in which both optical and electronic resources are available. Three different policies are introduced to decide on which criteria an IP flow arriving at a node must be bifurcated from the standard FAN architecture to be forwarded onto a transparent lightpath up to its destination. The performance of the three proposed policies are discussed in terms of goodput and of queueing delay.
骨干网正在向IP over WDM架构迁移。在这种多层网络配置中，为了向最终用户提供增强的服务质量(QoS)，需要有效地结合两层的资源。在现有IP网络的背景下，流感知网络(flow-aware networking, FAN)被提出，目的是为IP路由器内的多路IP流提供QoS保证。FAN基于隐式准入控制和每流调度。在本文中，我们提出了一种新的节点架构，将FAN概念扩展到IP over WDM覆盖网络，其中光和电子资源都可用。引入了三种不同的策略来决定到达节点的IP流必须根据哪些标准从标准FAN架构分叉，然后转发到透明光路直至目的地。从商品投放和排队延迟的角度讨论了这三种策略的性能。
{"title":"Extension of the Flow-Aware Networking (FAN) architecture to the IP over WDM environment","authors":"V. López, C. Cárdenas, J.A. Hernandez, J. Aracil, M. Gagnaire","doi":"10.1109/ITNEWS.2008.4488137","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488137","url":null,"abstract":"Backbone networks are migrating to IP over WDM architectures. In such multi-layer network configurations, it is necessary to combine efficiently the resources of both layers in order to provide enhanced quality of service (QoS) to the end-users. In the context of existing IP networks, flow-aware networking (FAN) has been proposed in order to provide QoS guarantees to multiplexed IP flows within an IP router. FAN is based on implicit admission control and per-flow scheduling. In this paper, we propose a new node architecture that extends the FAN concept to IP over WDM overlayed networks in which both optical and electronic resources are available. Three different policies are introduced to decide on which criteria an IP flow arriving at a node must be bifurcated from the standard FAN architecture to be forwarded onto a transparent lightpath up to its destination. The performance of the three proposed policies are discussed in terms of goodput and of queueing delay.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129648881","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}
Pub Date : 2008-04-11DOI: 10.1109/ITNEWS.2008.4488123
R. Bolla, M. Canini, R. Rapuzzi, M. Sciuto
Nowadays the majority of Internet traffic is generated by peer-to-peer (P2P) file sharing applications. As the popularity of these applications has been increasing dramatically over the past few years, it becomes increasingly important to analyze their behavior and to understand their effects on the network. The ability to quantify their impact on the network is fundamental to a number of network operations, including traffic engineering, capacity planning, quality of service, forecasting for long-term provisioning, etc. We present here a measurement study on the characteristics of the traffic associated with two different P2P applications. Our aim is to provide useful insight into the nature of P2P traffic from the point of view of the network. To achieve this, we introduce a novel meauserement, Content Transfer Index (CTI), to distinguish two classes of behavior associated with P2P traffic: the download and the signaling traffic profile. Next we apply the CTI to our data sets and show that it effectively offers a general characterization of P2P traffic. Finally, we present a number of statistical measurements that are significantly unbiased due to having considered the distinction between the two classes. To the best of our knowledge, this is the first study to follow this approach. We believe such a study will help researchers better understand the impact of P2P applications on the network and how to improve their performance.
{"title":"Characterizing the network behavior of P2P traffic","authors":"R. Bolla, M. Canini, R. Rapuzzi, M. Sciuto","doi":"10.1109/ITNEWS.2008.4488123","DOIUrl":"https://doi.org/10.1109/ITNEWS.2008.4488123","url":null,"abstract":"Nowadays the majority of Internet traffic is generated by peer-to-peer (P2P) file sharing applications. As the popularity of these applications has been increasing dramatically over the past few years, it becomes increasingly important to analyze their behavior and to understand their effects on the network. The ability to quantify their impact on the network is fundamental to a number of network operations, including traffic engineering, capacity planning, quality of service, forecasting for long-term provisioning, etc. We present here a measurement study on the characteristics of the traffic associated with two different P2P applications. Our aim is to provide useful insight into the nature of P2P traffic from the point of view of the network. To achieve this, we introduce a novel meauserement, Content Transfer Index (CTI), to distinguish two classes of behavior associated with P2P traffic: the download and the signaling traffic profile. Next we apply the CTI to our data sets and show that it effectively offers a general characterization of P2P traffic. Finally, we present a number of statistical measurements that are significantly unbiased due to having considered the distinction between the two classes. To the best of our knowledge, this is the first study to follow this approach. We believe such a study will help researchers better understand the impact of P2P applications on the network and how to improve their performance.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125126216","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：