{"title":"Towards a Comprehensive Understanding of Routing on Complex networks","authors":"Guoqiang Zhang, Bin Yuan, Guoqing Zhang","doi":"10.1109/NGI.2007.371210","DOIUrl":"https://doi.org/10.1109/NGI.2007.371210","url":null,"abstract":"Efficient routing on complex networks becomes essentially important as complex network structures have been discovered in a wide range of contexts, especially in the Internet field. Topological knowledge plays a critical role in achieving efficient routing in such networks. An aspect of interest to the research community is the critical transportation capability Rc of a network where a phase transition occurs. In this paper, we develop a more general theoretical Rc estimation approach and study the traffic dynamics on complex networks under different node capability models and different routing strategies for a wealth of network topologies. We take more realistic constraints into account in our study and as a consequence, we believe the results obtained offer informative guidelines for designing network architectures and routing protocols.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"41 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":"122669724","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":"Marginal Productivity Index Policies for Scheduling Multiclass Delay-/Loss-Sensitive Traffic with Delayed State Observation","authors":"J. Niño-Mora","doi":"10.1109/NGI.2007.371218","DOIUrl":"https://doi.org/10.1109/NGI.2007.371218","url":null,"abstract":"This paper addresses the problem of dynamic bandwidth allocation in a channel to multiclass packet traffic, where each traffic class has a finite dedicated buffer. Class-dependent linear holding and rejection cost rates are used to model differing levels of tolerance to delay and loss. Time is slotted, and the controller's backlog information is delayed by one slot. The goal is to design well-grounded and tractable scheduling policies that nearly minimize expected total discounted or long-run average cost. New dynamic index policies are introduced, awarding higher priority to classes with larger index values, where a class' index measures the marginal productivity of work at its current state. The results are obtained by deploying the work-cost analysis approach to marginal productivity indices (MPIs) for restless bandits developed by the author. The results of a computational study on two-class instances are reported, shedding light on how the MPI policy's relative performance varies with each parameter. Across the range of instances explored, the MPI policy is shown to be nearly optimal, and to substantially outperform conventional benchmark policies.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"62 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":"127042187","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}
T. Chiba, H. Yokota, A. Idoue, A. Dutta, Subir Das, Fuchun J. Lin, H. Schulzrinne
{"title":"Mobility Management Schemes for Heterogeneity Support in Next Generation Wireless Networks","authors":"T. Chiba, H. Yokota, A. Idoue, A. Dutta, Subir Das, Fuchun J. Lin, H. Schulzrinne","doi":"10.1109/NGI.2007.371209","DOIUrl":"https://doi.org/10.1109/NGI.2007.371209","url":null,"abstract":"Seamless mobility support in a heterogeneous roaming environment poses several challenging issues in the choice of network architecture design and mobility protocol. Several standards organizations are designing next generation wireless network architectures with a suite of new network elements and protocols that provide service continuity for intra-and inter-provider roaming. However, each of these mobility solutions provides its own set of signaling mechanisms and methods of interaction with different functional network elements. Thus, it becomes a challenging task for the network operators and service providers to support roaming to the visited networks with diverse capabilities while supporting service continuity. In this paper, we first highlight some of the next generation standards and then describe the main functional components of a generic next generation wireless architecture as described in several evolving standards. We then focus on the operational usage of network layer mobility protocols such as Client Mobile IP, Proxy Mobile IP and application layer mobility protocol for next generation networks, and address the operational issues associated with roaming and service continuity. Finally, we propose comprehensive mobility solutions that support the heterogeneity associated with the intra-and inter-provider roaming.","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":"133626244","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}
I. Vidal, I. Soto, F. Valera, Jaime García, A. Azcorra
{"title":"IMS signalling for multiparty services based on network level multicast","authors":"I. Vidal, I. Soto, F. Valera, Jaime García, A. Azcorra","doi":"10.1109/NGI.2007.371204","DOIUrl":"https://doi.org/10.1109/NGI.2007.371204","url":null,"abstract":"The standardization process of the UMTS technology has led to the development of the IP Multimedia Subsystem (IMS). IMS provides a framework that supports the negotiation of the next generation multimedia services with QoS requirements that are envisioned for 3G networks. But even though many of these services involve the participation of multiple users in a multiparty arrangement, the delivery technology at network level is still unicast based. This approach is not optimum, in terms of transmission efficiency. In this paper, a new approach is presented proposing to use a network level multicast delivery technology for the multiparty services that are signalled through IMS. The main advantages and drawbacks related with this new approach are analyzed in the article. Finally, as a starting point in the development of the presented solution, a new SIP signalling dialogue is proposed allowing the negotiation of a generic multiparty service, and supporting at the same time the configuration of the corresponding network level multicast delivery service with QoS requirements that will be used in the user plane.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"96 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":"131979859","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":"Determining the Moments of Queue-Length Distribution of Discriminatory Processor-Sharing Systems with Phase-Type Service Requirements","authors":"J. Leino, J. Virtamo","doi":"10.1109/NGI.2007.371217","DOIUrl":"https://doi.org/10.1109/NGI.2007.371217","url":null,"abstract":"In this paper, we study discriminatory processor sharing systems in which different customer classes receive different rates of service according to class weights. DPS systems have many interesting applications in modelling of, e.g., computer or telecommunication systems. In prior work, assuming phase-type service requirement distribution, the moments of the number of customers have been found as a solution of a system of linear equations. In this paper, we present an alternative approach to the same problem allowing us to derive similar results. We use a method based on the theory of Markov decision processes and show that exact results are achieved. The moments of the queue length distribution may be solved from a system of linear equations. While not as efficient as the previous method, our approach also provides the value function of the system which may be used in policy optimization.","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":"130270381","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 Survey of Reliable Multicast Communication","authors":"A. Popescu, D. Constantinescu, D. Erman, D. Ilie","doi":"10.1109/NGI.2007.371205","DOIUrl":"https://doi.org/10.1109/NGI.2007.371205","url":null,"abstract":"The paper reports on recent developments and challenges in reliable multicast communication, with special focus on reliable multicast communication at the application layer. The foundation of reliable multicast communication is given by several components, which are multicast communication, congestion control and error control. Our paper is providing a survey of these mechanisms in multicast environments.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"6 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":"127835308","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":"Methods of Distinguishing Flash Crowds from Spoofed DoS Attacks","authors":"Quyen Le, M. Zhanikeev, Y. Tanaka","doi":"10.1109/NGI.2007.371212","DOIUrl":"https://doi.org/10.1109/NGI.2007.371212","url":null,"abstract":"Web services have become an indispensable part of the Internet and the world. We have learned their applicability in every aspects of human life which lead to the huge amount of Web traffic exchanged over the Internet everyday. This excessive popularity is also the cause that led to some troubles. Among them, Flash crowds and Denial of Service (DoS) attacks are the two major concerns for the stability and safety of the Web services. So far, there are some methods that can detect the occurrences of these incidents in network traffic, however it still remains unclear how to explicitly distinguish DoS attacks and Flash crowds as these anomalies are very much alike. In this paper, we present various analyses on traffic traces of DoS attacks and Flash crowds to prove that even though DoS attacks mimic Flash crowds, there are still several differences in various aspects of these two incidents. As long as Flash crowd is an unusual traffic phenomenon of web user communities, there must be some features that a single DoS attacker cannot imitate. We specially focused on the source distribution and the variation pattern in traffic and archived remarkable results.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"25 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":"126572431","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":"Seamless Connectivity in WLAN and Cellular Networks with Multi Criteria Decision Making","authors":"L. Isaksson, M. Fiedler","doi":"10.1109/NGI.2007.371198","DOIUrl":"https://doi.org/10.1109/NGI.2007.371198","url":null,"abstract":"The evolution of today's wireless and mobile technologies and personalized hand-held devices has increased the challenge to handle the trade-off between mobility, performance and cost. The user simply needs to be Always Best Connected (ABC). To make this happen, different types of criteria reflecting relevant characteristics of wireless and mobile access networks such as WLAN, UMTS and GPRS have to be established and judged. In this paper the criteria are divided into three main groups, performance, cost and accessibility. The criteria are fed into a Multi-Criteria Decision Making (MCDM) tool which is able to deliver a ranking of network links in order to become ABC. Finally, a case study with two different Generic Services (GSs) illustrates the decision making process and its outcomes in different situations.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"41 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":"130391265","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":"Why VCG auctions can hardly be applied to the pricing of inter-domain and ad hoc networks","authors":"P. Maillé, B. Tuffin","doi":"10.1109/NGI.2007.371195","DOIUrl":"https://doi.org/10.1109/NGI.2007.371195","url":null,"abstract":"The use of Vickrey-Clarke-Groves (VCG) auction mechanisms is gaining popularity in the networking community, where it seems compulsory to incentivize selfish nodes (in ad hoc networks) or domains (in inter-domain communications) to forward the traffic of their peers. Indeed, VCG auctions are known to both be efficient and produce proper incentives. In this note, we argue that, in fact, VCG auctions can hardly be applied to those problems, for different reasons depending on the model studied: 1. If some resource constraints (bandwidth, spectrum, and/or power) have to be taken into account, then computing allocations and prices implies solving optimization problems that are computationally hard for general network topologies. 2. If there are no such resource constraints, then VCG auctions, even if verifying many important and satisfactory properties, cannot verify a major one that is budget balance: the sum of subsidies given to relay nodes exceeds the sum of charges paid by traffic senders. This means that the auction regulator is required to continuously inject money to make the scheme work, which is unlikely to happen. In a second step, we discuss the combinations of properties that can be verified together, and prioritize them for finding out a proper pricing scheme.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"22 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":"114509233","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":"IETF: The Next Generation - what is a generation, anyway?","authors":"H. Alvestrand","doi":"10.1109/NGI.2007.371187","DOIUrl":"https://doi.org/10.1109/NGI.2007.371187","url":null,"abstract":"The term \"generation\" is used heavily, usually with the idea that there can be fundamental changes to the way in which things work. Some fundamental changes have happened, and caused great upheavals in the way we manage our daily lives - other things that have been labelled \"next generation\" have vanished without a trace. This talk focuses on how standards processes interact with the concept of radical change, and aims to show some of the mechanisms that act to enable, encourage or discourage radical changes in technology.","PeriodicalId":207883,"journal":{"name":"2007 Next Generation Internet Networks","volume":"85 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":"121074607","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}