Pub Date : 2005-04-18DOI: 10.1109/NGI.2005.1431702
L. Noirie
Nowadays, transport networks are mainly based on SDH/SONET whereas the traffic becomes more Ethernet/IP oriented. The trend is to make the transport infrastructure more packet-aware, using for example multi-service transport platforms (MSTP). For transport infrastructure, such MSTP solutions are in competition with pure TDM platforms and pure packets ones. The paper demonstrates that, considering a network evolution in which the users' access rates increase faster than their mean rates, introduction of MSTP is justified when one considers the efficiency of the bandwidth use in the links of the networks. For this comparison, we developed an equivalent bandwidth model, including non-Gaussian characteristics, uncertainty and variability of the traffic. We defined the equivalent access rate, and the corresponding equivalent number of active flows, which is the key parameter to dimension the links. This new model may have some limitations. But it is simple, and it is realistic enough to understand the general trends between packet and TDM solutions in the transport networks.
{"title":"Mixed TDM and packet technologies as a best compromise solution to ensure a cost-effective bandwidth use with the current traffic evolution","authors":"L. Noirie","doi":"10.1109/NGI.2005.1431702","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431702","url":null,"abstract":"Nowadays, transport networks are mainly based on SDH/SONET whereas the traffic becomes more Ethernet/IP oriented. The trend is to make the transport infrastructure more packet-aware, using for example multi-service transport platforms (MSTP). For transport infrastructure, such MSTP solutions are in competition with pure TDM platforms and pure packets ones. The paper demonstrates that, considering a network evolution in which the users' access rates increase faster than their mean rates, introduction of MSTP is justified when one considers the efficiency of the bandwidth use in the links of the networks. For this comparison, we developed an equivalent bandwidth model, including non-Gaussian characteristics, uncertainty and variability of the traffic. We defined the equivalent access rate, and the corresponding equivalent number of active flows, which is the key parameter to dimension the links. This new model may have some limitations. But it is simple, and it is realistic enough to understand the general trends between packet and TDM solutions in the transport networks.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066761","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431659
M. Menth, J. Milbrandt, A. Reifert
In this work, we present several end-to-end protection switching mechanisms for application in multiprotocol label switching (MPLS). In case of local outages in the network, they deviate the traffic around the failed element over backup paths. They are easy to implement and reduce the additional capacity to maintain the quality of service (QoS) on the backup paths. We study the capacity savings of the presented methods for various protection schemes with different traffic matrices. We further test the influence of different resilience constraints such as the set of protected failure scenarios, bandwidth reuse restrictions due to optical communication, and traffic reduction due to failed border routers.
{"title":"Sensitivity of backup capacity requirements to traffic distribution and resilience constraints","authors":"M. Menth, J. Milbrandt, A. Reifert","doi":"10.1109/NGI.2005.1431659","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431659","url":null,"abstract":"In this work, we present several end-to-end protection switching mechanisms for application in multiprotocol label switching (MPLS). In case of local outages in the network, they deviate the traffic around the failed element over backup paths. They are easy to implement and reduce the additional capacity to maintain the quality of service (QoS) on the backup paths. We study the capacity savings of the presented methods for various protection schemes with different traffic matrices. We further test the influence of different resilience constraints such as the set of protected failure scenarios, bandwidth reuse restrictions due to optical communication, and traffic reduction due to failed border routers.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122037465","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431688
A. Zwierko, Z. Kotulski
This paper provides a description of a new protocol for group authentication. The demand for anonymity have grown with a recent development of networking. On the other hand, all service providers, bound by the legal regulations have to be able to trace an entity that performed every single action, sent a specific data and so on. Finding a reasonable trade-off between these two requirements is rather hard. In this paper, we propose a protocol that provides a user within a group with the anonymity (for outside world the users within a group cannot be identified) and when needed provide a trusted authority with a possibility to identity each user.
{"title":"A new protocol for group authentication providing partial anonymity","authors":"A. Zwierko, Z. Kotulski","doi":"10.1109/NGI.2005.1431688","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431688","url":null,"abstract":"This paper provides a description of a new protocol for group authentication. The demand for anonymity have grown with a recent development of networking. On the other hand, all service providers, bound by the legal regulations have to be able to trace an entity that performed every single action, sent a specific data and so on. Finding a reasonable trade-off between these two requirements is rather hard. In this paper, we propose a protocol that provides a user within a group with the anonymity (for outside world the users within a group cannot be identified) and when needed provide a trusted authority with a possibility to identity each user.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130664168","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431674
B. Gaujal, A. Hordijk
In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.
{"title":"On dropping sequences for RED","authors":"B. Gaujal, A. Hordijk","doi":"10.1109/NGI.2005.1431674","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431674","url":null,"abstract":"In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130461971","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431667
J. Wang, Y. Dong
In this paper, we discuss a cost transformation based routing mechanism. The idea is to transform any traffic engineering (TE) routing problem to a known (e.g. shortest path routing) problem, such that a solution to the known problem is a sub-optimal solution to the original. Instead of relying on human to "guess" the best transformation function for each practical problem; we developed a numerical search mechanism to automatically discover the function. So far, we have tested this mechanism on four routing problems-among them are some classic constraint-routing problems and an emerging dual-path routing problem-and the results are comparable or better than those from some well-known heuristics. More importantly, these example applications showcase how routing solutions are achieved with minimum human intervention.
{"title":"A cost transformation based routing mechanism and its applications on constraint-routing problems","authors":"J. Wang, Y. Dong","doi":"10.1109/NGI.2005.1431667","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431667","url":null,"abstract":"In this paper, we discuss a cost transformation based routing mechanism. The idea is to transform any traffic engineering (TE) routing problem to a known (e.g. shortest path routing) problem, such that a solution to the known problem is a sub-optimal solution to the original. Instead of relying on human to \"guess\" the best transformation function for each practical problem; we developed a numerical search mechanism to automatically discover the function. So far, we have tested this mechanism on four routing problems-among them are some classic constraint-routing problems and an emerging dual-path routing problem-and the results are comparable or better than those from some well-known heuristics. More importantly, these example applications showcase how routing solutions are achieved with minimum human intervention.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525130","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431653
T. Wauters, J. Coppens, B. Dhoedt, P. Demeester
The concept of content distribution networks (CDNs) has recently been introduced to enhance the delivery of bandwidth-intensive multimedia content to end users. In a CDN architecture, the content is replicated from the origin server to so-called surrogate servers at the edge of the Internet, to improve the quality of service and optimise network bandwidth usage. The introduction of peer-to-peer (P2P) architectures, where all nodes fundamentally play equal roles, enables self-organisation of the CDN and automatic recovery in case of node failures. To optimise the distribution of the content over the different surrogate servers, replica placement algorithms (RPAs) have been developed. In this paper, we present two distributed RPAs for CDNs. We will demonstrate that they further improve CDN performance by reducing the server load and the bandwidth usage. The introduction of link costs allows these algorithms to additionally support load balancing on the network links.
{"title":"Load balancing through efficient distributed content placement","authors":"T. Wauters, J. Coppens, B. Dhoedt, P. Demeester","doi":"10.1109/NGI.2005.1431653","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431653","url":null,"abstract":"The concept of content distribution networks (CDNs) has recently been introduced to enhance the delivery of bandwidth-intensive multimedia content to end users. In a CDN architecture, the content is replicated from the origin server to so-called surrogate servers at the edge of the Internet, to improve the quality of service and optimise network bandwidth usage. The introduction of peer-to-peer (P2P) architectures, where all nodes fundamentally play equal roles, enables self-organisation of the CDN and automatic recovery in case of node failures. To optimise the distribution of the content over the different surrogate servers, replica placement algorithms (RPAs) have been developed. In this paper, we present two distributed RPAs for CDNs. We will demonstrate that they further improve CDN performance by reducing the server load and the bandwidth usage. The introduction of link costs allows these algorithms to additionally support load balancing on the network links.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131733049","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431698
Manos Dramitinos, G. Stamoulis, C. Courcoubetis
Data, audio and video services over 3G networks possess certain requirements in QoS and thus in resources. Accommodating such service requests constitutes a challenge for UMTS networks. To this end, 3GPP Release 5 introduces the high speed downlink packet access (HSDPA). In this paper, we propose: i) an auction-based HSDPA resource allocation mechanism, which consists of a series of Generalized Vickrey Auctions that are conducted in the short time-scale over which the network resources are allocated and ii) a set of innovative user utility functions. These functions provide a quantification of both the user's willingness to pay for reserving resources in the short time-scale auctions and his attained utility from the pattern of resources allocated during his long time-scale service session. The utility functions are additive and are used as bidding functions in the series of auctions the user participates. Each user selects one of these functions, which is scaled by his total willingness to pay. Then, the network runs the auctions by bidding on behalf of each user. The effectiveness of our mechanism has been assessed experimentally and it appears that most of the users either are served very satisfactorily or are allocated very limited quantities of resources (if at all) at a low total charge.
{"title":"Auction-based resource allocation in UMTS high speed downlink packet access (HSDPA)","authors":"Manos Dramitinos, G. Stamoulis, C. Courcoubetis","doi":"10.1109/NGI.2005.1431698","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431698","url":null,"abstract":"Data, audio and video services over 3G networks possess certain requirements in QoS and thus in resources. Accommodating such service requests constitutes a challenge for UMTS networks. To this end, 3GPP Release 5 introduces the high speed downlink packet access (HSDPA). In this paper, we propose: i) an auction-based HSDPA resource allocation mechanism, which consists of a series of Generalized Vickrey Auctions that are conducted in the short time-scale over which the network resources are allocated and ii) a set of innovative user utility functions. These functions provide a quantification of both the user's willingness to pay for reserving resources in the short time-scale auctions and his attained utility from the pattern of resources allocated during his long time-scale service session. The utility functions are additive and are used as bidding functions in the series of auctions the user participates. Each user selects one of these functions, which is scaled by his total willingness to pay. Then, the network runs the auctions by bidding on behalf of each user. The effectiveness of our mechanism has been assessed experimentally and it appears that most of the users either are served very satisfactorily or are allocated very limited quantities of resources (if at all) at a low total charge.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"207 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134427829","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431694
I. Juva, R. Susitaival, M. Peuhkuri, S. Aalto
For Internet traffic engineering purposes, it is important to characterize traffic volumes typically over 5-minute intervals. Based on measurements made in a local network at Lucent in winter 1999, Cao et al., (2000) proposed a moving IID Gaussian model for the characterization of 5-minute traffic volumes, with a power-law relationship between the mean and the variance. In this paper we analyze novel measurements gathered from a 2.5 Gbps link in the Finnish university network (Funet) in summer 2004. We investigate the validity of the moving IID Gaussian model and the proposed mean-variance relationship when the measurement interval is varying from 1 second to 5 minutes. As a result, we find that the Gaussian assumption is much more justified with current core link rates. The mean-variance relationship seems, indeed, to follow a power-law with exponent approximately equal to 1.3 in our data set. However, the IID assumption concerning the standardized residual is not verified, but we find a clear positive correlation between adjacent 5-minute volumes, and only slightly weaker negative correlation for traffic volumes with distance 20-30 minutes. In addition, we demonstrate that the same phenomenon is already prevailing in the Lucent data set.
{"title":"Traffic characterization for traffic engineering purposes: analysis of Funet data","authors":"I. Juva, R. Susitaival, M. Peuhkuri, S. Aalto","doi":"10.1109/NGI.2005.1431694","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431694","url":null,"abstract":"For Internet traffic engineering purposes, it is important to characterize traffic volumes typically over 5-minute intervals. Based on measurements made in a local network at Lucent in winter 1999, Cao et al., (2000) proposed a moving IID Gaussian model for the characterization of 5-minute traffic volumes, with a power-law relationship between the mean and the variance. In this paper we analyze novel measurements gathered from a 2.5 Gbps link in the Finnish university network (Funet) in summer 2004. We investigate the validity of the moving IID Gaussian model and the proposed mean-variance relationship when the measurement interval is varying from 1 second to 5 minutes. As a result, we find that the Gaussian assumption is much more justified with current core link rates. The mean-variance relationship seems, indeed, to follow a power-law with exponent approximately equal to 1.3 in our data set. However, the IID assumption concerning the standardized residual is not verified, but we find a clear positive correlation between adjacent 5-minute volumes, and only slightly weaker negative correlation for traffic volumes with distance 20-30 minutes. In addition, we demonstrate that the same phenomenon is already prevailing in the Lucent data set.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123775389","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431664
Carlos B. Lopes, A. Sousa, Luís Gouveia
MPLS (multi-protocol label switching) technology provides the flexibility required for managing the way the traffic is routed through the network. However, label switched path (LSP) configuring is a hard task in a growing network, as more and more routes need configuring and monitoring. A viable alternative may be to rely on an IGP (interior gateway protocol) routing protocol to determine the paths to be used by the LSPs, thus freeing the operator from the manual configuring of all LSP paths. Here, we address the procedure of dimensioning a MPLS network where a minimum weight routing protocol (as OSPF or IS-IS) is used to determine the paths of the LSPs. We start by presenting the complete minimum weight routing network design problem (MWRNDP) with explicit minimum weight routing constraints. Then, we propose a two-step approach based on two ILP models which are a decomposition of the complete model in two separate optimization problems: first, we determine the physical network configuration and the traffic flow routing with the network design problem (NDP); then, we determine the link weights required to achieve the determined traffic routing with the link weight assignment problem (LWA). Because in the first problem the traffic routing is destination based, there may be instances where a minimum weight routing solution is not found. In these cases, an additional constraint is added to the first problem and the two-step approach is repeated. An important observation is that this methodology obtains the optimal solutions and the computational results show that it requires much lower computational times than the original global MWRNDP model. Using the two-step approach, a set of computational tests is presented to determine the cost penalty in MPLS network design when using minimum weight routing as opposed to source based routing.
{"title":"Combined link dimensioning and weight assignment of minimum weight routing networks","authors":"Carlos B. Lopes, A. Sousa, Luís Gouveia","doi":"10.1109/NGI.2005.1431664","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431664","url":null,"abstract":"MPLS (multi-protocol label switching) technology provides the flexibility required for managing the way the traffic is routed through the network. However, label switched path (LSP) configuring is a hard task in a growing network, as more and more routes need configuring and monitoring. A viable alternative may be to rely on an IGP (interior gateway protocol) routing protocol to determine the paths to be used by the LSPs, thus freeing the operator from the manual configuring of all LSP paths. Here, we address the procedure of dimensioning a MPLS network where a minimum weight routing protocol (as OSPF or IS-IS) is used to determine the paths of the LSPs. We start by presenting the complete minimum weight routing network design problem (MWRNDP) with explicit minimum weight routing constraints. Then, we propose a two-step approach based on two ILP models which are a decomposition of the complete model in two separate optimization problems: first, we determine the physical network configuration and the traffic flow routing with the network design problem (NDP); then, we determine the link weights required to achieve the determined traffic routing with the link weight assignment problem (LWA). Because in the first problem the traffic routing is destination based, there may be instances where a minimum weight routing solution is not found. In these cases, an additional constraint is added to the first problem and the two-step approach is repeated. An important observation is that this methodology obtains the optimal solutions and the computational results show that it requires much lower computational times than the original global MWRNDP model. Using the two-step approach, a set of computational tests is presented to determine the cost penalty in MPLS network design when using minimum weight routing as opposed to source based routing.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105743","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 : 2005-04-18DOI: 10.1109/NGI.2005.1431671
R. Holanda, J. Garcia
A critical requirement for performance evaluation and design of network elements is the availability of realistic traffic traces. There are, however, several reasons that makes it difficult to have access to them. Firstly, Internet providers are usually reluctant to make real traces public, secondly, hardware for collecting traces at high speed is usually expensive, and finally, with the increase of link rates, the required storage for packet traces of meaningful duration becomes too large. In this paper we address the problem of compression of these potentially huge packet traces. We propose a novel packet header compression, focused not on the problem of reducing transmission bandwidth or latency, but on the problem of saving storage space. As far as we know, ours is the first method specifically oriented to this goal. With our proposed method, storage size requirements for .tsh packet headers are reduced to 16% of its original size. The compression proposed here is more efficient than any other existing method and simple to implement. Others known methods have their compression ratio bounded to 50% and 32%.
{"title":"A lossless compression method for Internet packet headers","authors":"R. Holanda, J. Garcia","doi":"10.1109/NGI.2005.1431671","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431671","url":null,"abstract":"A critical requirement for performance evaluation and design of network elements is the availability of realistic traffic traces. There are, however, several reasons that makes it difficult to have access to them. Firstly, Internet providers are usually reluctant to make real traces public, secondly, hardware for collecting traces at high speed is usually expensive, and finally, with the increase of link rates, the required storage for packet traces of meaningful duration becomes too large. In this paper we address the problem of compression of these potentially huge packet traces. We propose a novel packet header compression, focused not on the problem of reducing transmission bandwidth or latency, but on the problem of saving storage space. As far as we know, ours is the first method specifically oriented to this goal. With our proposed method, storage size requirements for .tsh packet headers are reduced to 16% of its original size. The compression proposed here is more efficient than any other existing method and simple to implement. Others known methods have their compression ratio bounded to 50% and 32%.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127133049","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
扫码关注我们
求助内容：
应助结果提醒方式：