Next Generation Internet Networks, 2005最新文献

Users and services in intelligent networks 智能网络中的用户和业务

Next Generation Internet Networks, 2005 Pub Date : 2005-12-13 DOI: 10.1007/11599593_3

E. Gelenbe

引用次数: 36

Web-based service for remote execution: NGI network design application 基于web的远程执行服务:NGI网络设计应用程序

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431684

Alberto E. García, K. Hackbarth, Roberto Ortiz Telematic

引用次数: 0

Source specific multicast (SSM) group management analysis framework for the next generation mobile Internet 下一代移动互联网特定源组播(SSM)组管理分析框架

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431696

G. Kurup, Y. Sekercioglu, N. Mani

{"title":"Source specific multicast (SSM) group management analysis framework for the next generation mobile Internet","authors":"G. Kurup, Y. Sekercioglu, N. Mani","doi":"10.1109/NGI.2005.1431696","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431696","url":null,"abstract":"Source specific multicast (SSM) is the most promising and realistic group communication architecture on the Internet to date. Mobile IPv6 capability and pervasive wireless access will enable and further encourage personal electronic devices to rely on the Internet for communications. Consequently, we are likely to witness an increase of broadcast-like and peer-to-peer multimedia applications designed for mobile networks and devices. Multicast, especially the source specific multicast architecture, is an advantageous delivery mechanism for such applications in bandwidth constrained environments. Although SSM is an efficient and scalable architecture, there exists many issues to be resolved prior to successful large scale deployment. For example, the performance of SSM applications over mobile networks has not been well researched to date. In this paper, we present our analysis framework to investigate multicast listener discovery version 2 (MLDv2) characteristics. We want to determine the effects and results of tuning various parameters for group management made available by the IETF specification. Our eventual study aims to incorporate and analyse all the relevant protocols for SSM MIPv6 and provide a reference for IP engineers intending to deploy such services.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"31 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":"122018232","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}

引用次数: 1

Applications of the max-min fairness principle in telecommunication network design 最大最小公平原则在电信网络设计中的应用

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431669

M. Pióro, M. Dzida, E. Kubilinskas, P. Nilsson

{"title":"Applications of the max-min fairness principle in telecommunication network design","authors":"M. Pióro, M. Dzida, E. Kubilinskas, P. Nilsson","doi":"10.1109/NGI.2005.1431669","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431669","url":null,"abstract":"The rapid growth of traffic induced by Internet services makes the simple over-provisioning of resources not economical and hence imposes new requirements on the dimensioning methods. Therefore, the problem of network design with the objective of minimizing the cost and at the same time solving the tradeoff between maximizing the service data flows and providing fair treatment of all demands becomes more and more important. In this context, the so-called max-min fair (MMF) principle is widely considered to help finding reasonable bandwidth allocation schemes for competing demands. Roughly speaking, MMF assumes that the worst service performance is maximized, and then is the second worst performance, the third one, and so on, leading to a lexicographically maximized vector of sorted demand bandwidth allocations. It turns out that the MMF optimal solution cannot be approached in a standard way (i.e., as a mathematical programming problem) due to the necessity of lexicographic maximization of ordered quantities (bandwidth allocated to demands). Still, for convex models, it is possible to formulate effective sequential procedures for such lexicographic optimization. The purpose of the presented paper is three-fold. First, it discusses resolution algorithms for a generic MMF problem related to telecommunications network design. Second, it gives a survey of network design instances of the generic formulation, and illustrates the efficiency of the general algorithms in these particular cases. Finally, the paper discusses extensions of the formulated problems into more practical (unfortunately non-convex) cases, where the general for convex MMF problems approach fails.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"28 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":"121152303","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}

引用次数: 17

A new path probing strategy for inter-domain multicast routing 一种新的域间组播路由路径探测策略

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431641

A. Costa, M. J. Nicolau, A. Santos, V. Freitas

引用次数: 4

New parameters and metrics for multiparty communications 多方通信的新参数和指标

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431693

Lei Liang, Zhili Sun, D. He

引用次数: 4

Multicast versus private flows: an efficient pricing scheme for congestion control 多播与私有流:用于拥塞控制的有效定价方案

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431655

Patrick Maillé

引用次数: 0

State-dependent optimal routing in MPLS-based networks with heterogeneous flow holding times 基于mpls的异构流保持时间网络中基于状态的最优路由

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431666

P. He, J. Regnier

{"title":"State-dependent optimal routing in MPLS-based networks with heterogeneous flow holding times","authors":"P. He, J. Regnier","doi":"10.1109/NGI.2005.1431666","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431666","url":null,"abstract":"This study investigates routing in a MPLS-based (multi-protocol label switching) IP network with heterogeneous holding time traffic (for example, an IP call versus an IP conference). Our basic idea is to exploit the large differences existing in the holding time of different types of traffic to make more efficient resource allocation decisions in the admission and routing processes. In particular, we investigate the concept of vacating, in which requests with short holding times vacate the bandwidth to requests with long holding times. Based on an analytical framework we developed, we analyze the vacating idea and propose several state-dependent routing schemes, namely preventive-vacating routing (PW), preemptive-vacating routing (PEV) and restricted-access routing (RAR). Both the analytical and simulation results indicate that within an effective range we found in traffic mix, our vacating schemes outperform the traditional LLR+TR (least loaded routing+trunk reservation) and Diff-SDR (differentiated dynamic shortest-distance routing scheme) S. Yang et al., (2001). Moreover, we deduce an approximated expression to compute the cost of accepting a long or short request, which leads to an approximated least cost routing (A-LCR) scheme. Through simulation study, A-LCR presents not only its good performing in network throughput, but also its particular flow control mechanism.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"35 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":"127487282","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}

引用次数: 0

Ethernet layer 2 label switched paths (LSP) 以太网第二层标签交换路径(LSP)

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431665

D. Papadimitriou, Emmanuel Dotaro, M. Vigoureux

引用次数: 11

A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement 基于歧视频率的工作年资和服务要求排队公平性度量

Next Generation Internet Networks, 2005 Pub Date : 2005-04-18 DOI: 10.1109/NGI.2005.1431654

Werner Sandmann

{"title":"A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement","authors":"Werner Sandmann","doi":"10.1109/NGI.2005.1431654","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431654","url":null,"abstract":"Queueing theory has dealt comprehensively with waiting times, throughput, or related properties. Another important issue, which is fair queueing, has been neglected for a long time and has received reasonable attention only very recently. As of today there are no generally accepted definitions and measures although some have been proposed. It has been recognized that measuring fairness in queues suffers from the dilemma that, depending on the application, queue scheduling pursues contradictory aims. Sometimes preference is given to short jobs, sometimes to jobs that already wait for quite a long time. In both cases one may get the impression that some jobs do not receive a fair treatment. In this paper we propose a queueing fairness measure which considers both service requirement and seniority of a job or customer. Our measure counts two types of discriminations that may bother customers: to be overtaken by other customers, and to wait due to customers with large service requirements. We show that our fairness measure adheres to previously published different preference principles, and we discuss possible measure refinements and the fairness of some scheduling policies.","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":"130291151","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}

引用次数: 28