{"title":"Authentication and Authorization Method in Multi-domain, Multi-provider Networks","authors":"S. G. Polito, H. Schulzrinne","doi":"10.1109/NGI.2007.371213","DOIUrl":"https://doi.org/10.1109/NGI.2007.371213","url":null,"abstract":"One of the open issues of the all-IP network Integrating wireless and wired technologies is the definition of an authentication, authorization solution running on multi-domain networks with different technologies that has a high security level and addresses the time requirements for real-time multimedia applications. At the same time, the increasing popularity of the voice-over-IP (VoIP) services requires call authorization solutions that allow to charge only one of the users involved in a multimedia session for the payment of all the resources used for it. In this paper, we propose a consortium-based trust model between providers of network resources and providers of voice-over-IP services that allows them to share information for the authentication and the authorization of their users. We define a new model for authentication and authorization of roaming users and a signaling solution for it based on the Extensible Authentication Protocol (EAP) and the Network Access Control Protocol (NACP). We also define a new authorization model for multi-domain VoIP calls and we propose a signaling solution for it based on the Next Steps in Signaling protocol (NSIS).","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131557617","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}
{"title":"Analyzing the file availability and download time in a P2P file sharing system","authors":"R. Susitaival, S. Aalto","doi":"10.1109/NGI.2007.371202","DOIUrl":"https://doi.org/10.1109/NGI.2007.371202","url":null,"abstract":"In this paper we study the performance of P2P file sharing systems. We are especially interested in how the division of the file into chunks as well as the used chunk selection policy influence on two performance metrics, named the availability and mean download time of the file. We propose a detailed Markov chain model that allows estimating the mean lifetime of the system and comparing different chunk selection policies exactly. In addition, we use simulations to evaluate more complex systems. Results suggest that splitting the file from one chunk into two chunks improves the performance of the system significantly. Meanwhile, the superiority of a chunk selection policy depends on many factors, such as the arrival rate of the new downloaders and service time distribution.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133831915","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}
B. A. de la Ossa, J.A. Gil, J. Sahuquillo, A. Pont
{"title":"Improving Web Prefetching by Making Predictions at Prefetch","authors":"B. A. de la Ossa, J.A. Gil, J. Sahuquillo, A. Pont","doi":"10.1109/NGI.2007.371193","DOIUrl":"https://doi.org/10.1109/NGI.2007.371193","url":null,"abstract":"Most of the research attempts to improve Web prefetching techniques have focused on the prediction algorithm with the objective of increasing its precision or, in the best case, to reduce the user's perceived latency. In contrast, to improve prefetching performance, this work concentrates in the prefetching engine and proposes the Prediction at Prefetch (P@P) technique. This paper explains how a prefetching technique can be extended to include our P@P proposal on real world conditions without changes in the web architecture or HTTP protocol. To show how this proposal can improve prefetching performance an extensive performance evaluation study has been done and the results show that P@P can considerably reduce the user's perceived latency with no additional cost over the basic prefetch mechanism.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129577901","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}
N. Moller, C. Barakat, Konstantin Avrachenkov, E. Altman
{"title":"Inter-protocol fairness between TCP New Reno and TCP Westwood","authors":"N. Moller, C. Barakat, Konstantin Avrachenkov, E. Altman","doi":"10.1109/NGI.2007.371207","DOIUrl":"https://doi.org/10.1109/NGI.2007.371207","url":null,"abstract":"In this paper we investigate the effect of introducing TCP Westwood+ on regular TCP New Reno. By means of analytical modeling and ns-2 simulations, we demonstrate that the two protocols get different shares of the available bandwidth in the network. Our main result is that the bandwidth sharing between the two protocols depends on one crucial parameter: the ratio between the bottleneck router buffer size and the bandwidth delay product. If the ratio is smaller than one, TCP Westwood+ takes more bandwidth. On the contrary, if the ratio is greater than one, it is TCP New Reno which gets the larger part. Inspired by our results, we propose a simple modification to the window decrease algorithm in TCP Westwood+ that solves the unfairness problem for large buffer sizes. For small buffers, the unfairness problem is still open.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116052730","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}
{"title":"On the relationship between the algebraic connectivity and graph's robustness to node and link failures","authors":"A. Jamakovic, Steve Uhlig","doi":"10.1109/NGI.2007.371203","DOIUrl":"https://doi.org/10.1109/NGI.2007.371203","url":null,"abstract":"We study the algebraic connectivity in relation to the graph's robustness to node and link failures. Graph's robustness is quantified with the node and the link connectivity, two topological metrics that give the number of nodes and links that have to be removed in order to disconnect a graph. The algebraic connectivity, i.e. the second smallest eigenvalue of the Laplacian matrix, is a spectral property of a graph, which is an important parameter in the analysis of various robustness-related problems. In this paper we study the relationship between the proposed metrics in three well-known complex network models: the random graph of Erdos-Renyi, the small-world graph of Watts-Strogatz and the scale-free graph of Barabasi-Albert. From (Fielder, 1973) it is known that the algebraic connectivity is a lower bound on both the node and the link connectivity. Through extensive simulations with the three complex network models, we show that the algebraic connectivity is not trivially connected to graph's robustness to node and link failures. Furthermore, we show that the tightness of this lower bound is very dependent on the considered complex network model.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"395 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116500905","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}
{"title":"Design and development of a DS-TE experimental testbed with Point-to-Multipoint LSP support","authors":"D. Adami, S. Giordano, F. Mustacchio, M. Pagano","doi":"10.1109/NGI.2007.371192","DOIUrl":"https://doi.org/10.1109/NGI.2007.371192","url":null,"abstract":"Nowadays, many IP backbone networks adopt separate control and forwarding planes for unicast and multicast traffic flows. Indeed, while MPLS (multiprotocol label switching) is widely deployed for unicast traffic, IP multicast is the only available solution for the delivery of \"one-to-many\" traffic flows. With P2MP LSPs (Point-to-Multipoint Label Switched Paths) support, a unified control and forwading plane may be devised. Such a reduction in the number of protocols used in the core of the network as well as in the number of encapsulations in the data plane, results in simplified network operations. The paper discusses the design and the development of the control and data planes extensions needed to provide P2MP LSP support in an MPLS network. In particular, such signalling and forwarding mechanisms have been implemented in a network testbed based on open-source routers. Finally, tests have been performed to assess the new mechanisms from both an operational and performance point-of-view.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132358723","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}
{"title":"A QoS-aware Multicast Routing Protocol for Wireless Access Networks","authors":"R. Boringer, S. Schmidt, A. Mitschele-Thiel","doi":"10.1109/NGI.2007.371206","DOIUrl":"https://doi.org/10.1109/NGI.2007.371206","url":null,"abstract":"This document describes an approach to integrate Quality of Service-aware multicast into Radio Access Networks (RAN). The protocol, O-MRP (Multicast Tree Optimization-enabled QoS-aware Multicast Routing Protocol) provides fast joining and leaving capabilities to support mobile users. Additionally, the protocol includes a mechanism for multicast route optimization, aiming on different optimization goals, like reduced resource consumption or minimum delay. The flexible integration of both features makes O-MRP outstanding. The approach requires changes to routers within the RAN only. Thus, the protocol is transparent to Mobile Nodes (MN) and network elements outside the RAN, which is an additional major benefit in comparison to other approaches. A simulation study compares the signalling overhead of the multicast protocol as well as the resource consumption with the classical unicast approach, widely used today.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133837624","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}
{"title":"Optimal Admission Control in Multimedia Mobile Networks with Movement Prediction: A Sensitivity Analysis","authors":"J. M. Giménez-Guzmán, J. Martínez-Bauset, V. Pla","doi":"10.1109/NGI.2007.371214","DOIUrl":"https://doi.org/10.1109/NGI.2007.371214","url":null,"abstract":"We study the problem of optimizing admission control policies in mobile multimedia cellular networks when predictive information regarding movement is available and we evaluate the gains that can be achieved by making such predictive information available to the admission controller. We consider a general class of prediction agents which forecast the number of future incoming handovers. For the optimization process we propose a novel Reinforcement Learning approach based on the concept of after states. The main objectives of the paper are twofold. First to quantify the impact that different ways of aggregating the movement prediction information referred to different service classes have on system performance. Second, to evaluate the sensitivity of the optimal anticipation time with which the admission controller needs to know the predictive information with different system parameters. Numerical results show that with the proposed aggregation of the predictive information we obtain policies as good as those obtained with the conventional representation of the system state, but at a lower computational cost. Besides, although the performance gain varies with system parameters, the location of its maximum remains almost invariant with the anticipation time in all the studied scenarios.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126436162","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}
{"title":"Trends towards Next Generation Internet","authors":"P. Tran-Gia","doi":"10.1109/NGI.2007.371188","DOIUrl":"https://doi.org/10.1109/NGI.2007.371188","url":null,"abstract":"In recent years we can witness a new wave of activities and projects to explore different paths towards Next Generation Internet. After the decade where the Internet Protocol becomes mainstream in communication networks integrating and carrying all new types of services with increasing traffic volume and complexity, there are rising concerns whether the aging Internet protocol architecture with its underlying legacy routing algorithms, control and security mechanisms would soon collapse under the load of new applications and the rapid change of traffic patterns and service generation paradigms in the next decade. In the talk we will focus on trends and evolution paths towards the Next Generation Network. The talk will discuss these trends together with issues of system performance and stochastic scalability, which are current topics of intensive research. These issues are crucial to dimension networks and applications, both from network provider and equipment manufacturer viewpoints. Some observations on future services will commence the talk. It will discuss the notion of Multi-Network Services, i.e. the paradigm shift from a network-centric view to a applicationcentric view. In the current existence of several wireless and wireline networks (PSTN, UMTS, WiMAX, etc.) users of different networks can install service-enabling software and start a new type of service in a short time scale and in a very dynamic way (e.g. VoIP platforms like Skype, software distribution schemes like Bittorrent, etc.). Those services are multi-networks services, which correspond to the term of Edge-based Intelligence.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125348548","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}
{"title":"A Mechanism for Charging System Self-Configuration in Next Generation Mobile Networks","authors":"R. Kuhne, G. Gormer, M. Schlager, G. Carle","doi":"10.1109/NGI.2007.371216","DOIUrl":"https://doi.org/10.1109/NGI.2007.371216","url":null,"abstract":"Self-management is an emerging idea in charging system research taken over from autonomic computing to address the complexity problem of system deployment, maintenance and administration and to improve the performance and flexibility of the charging system what will as a whole eventually decrease its total cost of ownership. In this paper, we describe a mechanism for charging system self-configuration when new network or service elements that record charging information are added as well as for charging system self-optimisation during every-day operation.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115685381","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}