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.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.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.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.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.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.1431652
J. Palmer, I. Mitrani
We consider the problem of how best to structure and control a distributed computer system containing many processors. The performance trade-offs associated with different tree structures are evaluated approximately by applying appropriate queueing models. It is shown that, for a given set of parameters and job distribution policy, there is an optimal tree structure that minimizes the overall average response time. This is obtained numerically through comparison of average response times. A simple heuristic policy is shown to perform well under certain conditions.
{"title":"Optimal tree structures for large service networks","authors":"J. Palmer, I. Mitrani","doi":"10.1109/NGI.2005.1431652","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431652","url":null,"abstract":"We consider the problem of how best to structure and control a distributed computer system containing many processors. The performance trade-offs associated with different tree structures are evaluated approximately by applying appropriate queueing models. It is shown that, for a given set of parameters and job distribution policy, there is an optimal tree structure that minimizes the overall average response time. This is obtained numerically through comparison of average response times. A simple heuristic policy is shown to perform well under certain conditions.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"84 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":"114506877","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.1431685
Javier Munoz Kirschberg, M. Delgado, S. S. Ribes
This paper introduces a new protocol, called RCCMP (reliable congestion controlled multicast protocol). This protocol has been designed to be simple, scalable (NAK suppression), reliable and TCP-friendly. The congestion control is a central part of the protocol, where the feedback of the worse receiver is used to control a transmission window in a TCP-like fashion. The scalability issue is addressed with an exponential tuners scheme, that is also used to estimate the number of receivers involved in the communication. The protocol neither needs support from network elements nor maintains state information dependent of the number of receivers. The paper also presents a number of simulation results on its performance.
{"title":"RCCMP: reliable congestion controlled multicast protocol","authors":"Javier Munoz Kirschberg, M. Delgado, S. S. Ribes","doi":"10.1109/NGI.2005.1431685","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431685","url":null,"abstract":"This paper introduces a new protocol, called RCCMP (reliable congestion controlled multicast protocol). This protocol has been designed to be simple, scalable (NAK suppression), reliable and TCP-friendly. The congestion control is a central part of the protocol, where the feedback of the worse receiver is used to control a transmission window in a TCP-like fashion. The scalability issue is addressed with an exponential tuners scheme, that is also used to estimate the number of receivers involved in the communication. The protocol neither needs support from network elements nor maintains state information dependent of the number of receivers. The paper also presents a number of simulation results on its performance.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"45 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":"123981288","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.1431644
János Tapolcai, P. Fodor, G. Rétvári, M. Maliosz, T. Cinkler
In this paper an advanced framework for minimum interference routing is proposed, which, despite its universal nature, is best suited for traffic engineering in optical networks. Minimum interference routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework Is a more advanced way of defining the "interference" between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.
{"title":"Class-based minimum interference routing for traffic engineering in optical networks","authors":"János Tapolcai, P. Fodor, G. Rétvári, M. Maliosz, T. Cinkler","doi":"10.1109/NGI.2005.1431644","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431644","url":null,"abstract":"In this paper an advanced framework for minimum interference routing is proposed, which, despite its universal nature, is best suited for traffic engineering in optical networks. Minimum interference routing is a method for engineering network resources to minimize the interference among high-volume traffic sources, in an attempt to maximize the useful throughput of the network. The main motivation behind the proposed framework Is a more advanced way of defining the \"interference\" between routes. This promotes the allocation of light-paths in an optical network without presuming any knowledge of future requests. The basic idea is that network links are classified into distinct criticality classes and additional capacity is defined for each criticality class. This additional capacity represents the amount of additional traffic that can be routed on those links, without increasing the network-wide interference. We provide a concise mathematical formula for class-based interference and propose a polynomial time heuristic to derive criticality classes. Based on our findings a flexible path selection scheme called MIRO is introduced. Finally, through extensive simulation studies, we show that the class-based interference framework more thoroughly describes link criticality than traditional methods, which transforms into more efficient routing in optical transport networks.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"57 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":"121183541","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
扫码关注我们
求助内容：
应助结果提醒方式：