Next Generation Internet Networks, 2005最新文献_第5页

Class-based minimum interference routing for traffic engineering in optical networks 光网络流量工程中基于类的最小干扰路由

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

János Tapolcai, P. Fodor, G. Rétvári, M. Maliosz, T. Cinkler

{"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}

引用次数: 7

Optimal tree structures for large service networks 大型业务网络的最优树形结构

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

J. Palmer, I. Mitrani

引用次数: 4

MOON: a new overlay network architecture for mobility and QoS support MOON:一种新的覆盖网络架构，用于移动性和QoS支持

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

G. Albertengo, C. Pastrone, G. Tolu

引用次数: 2

RCCMP: reliable congestion controlled multicast protocol RCCMP:可靠拥塞控制组播协议

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

Javier Munoz Kirschberg, M. Delgado, S. S. Ribes

引用次数: 5

Classification of Internet users using discriminant analysis and neural networks 基于判别分析和神经网络的互联网用户分类

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

A. Nogueira, M. R. D. Oliveira, P. Salvador, R. Valadas, António Pacheco

{"title":"Classification of Internet users using discriminant analysis and neural networks","authors":"A. Nogueira, M. R. D. Oliveira, P. Salvador, R. Valadas, António Pacheco","doi":"10.1109/NGI.2005.1431686","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431686","url":null,"abstract":"The (reliable) classification of Internet users, based on their hourly traffic profile, can be advantageous in several traffic engineering tasks and in the selection of suitable tariffing plans. For example, it can be used to optimize the routing by mixing users with contrasting hourly traffic profiles in the same network resources or to advise users on the tariffing plan that best suits their needs. In this paper we compare the use of discriminant analysis and artificial neural networks for the classification of Internet users. The classification is based on a partition obtained by cluster analysis. We classify the Internet users based on a data set measured at the access network of a Portuguese ISP. Using cluster analysis performed over half of the users (randomly chosen) we have identified three groups of users with similar behavior. The classification methods were applied to the second half of users and the obtained classification results compared with those of cluster analysis performed over the complete set of users. Our findings indicate both discriminant analysis and neural networks are valuable classification procedures, with the former slightly outperforming the latter, for the specific scenario under analysis.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"15 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":"114403179","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}

引用次数: 25

Direct and indirect methods for packet loss approximation in buffered systems 缓冲系统中丢包近似的直接和间接方法

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

A. Gulyás, J. Bíró

引用次数: 3

Measurement-based admission control for a flow-aware network 基于测量的流量感知网络准入控制

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

Yuming Jiang, P. Emstad, Anne Nevin, Victor Nicola, Markus Fidler

{"title":"Measurement-based admission control for a flow-aware network","authors":"Yuming Jiang, P. Emstad, Anne Nevin, Victor Nicola, Markus Fidler","doi":"10.1109/NGI.2005.1431683","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431683","url":null,"abstract":"To provide statistical service guarantee and achieve high network utilization, measurement-based admission control (MBAC) has been studied for over one decade. Many MBAC algorithms have been proposed in the literature. However, most of them belong to aggregate MBAC algorithms which assume or require that (1) first-in-first-out (FIFO) is used for aggregating flows; (2) statistical service guarantees are provided to the aggregate of admitted flows; (3) each flow requires and experiences the same statistical service guarantees as the aggregate. In this paper, we focus on per-flow MBAC that aims to provide possibly different statistical service guarantees to individual flows in an aggregate. Particularly, we propose a simple per-flow MBAC algorithm in which dynamic priority scheduling (DPS) is adopted to aggregate flows. With this DPS-based per-flow MBAC algorithm, a newly admitted flow is always given a lower priority level than all existing flows, and its priority level is improved if an existing flow leaves the system. Consequently, once a flow is admitted, its received service will not be adversely affected by other flows admitted after it. Because of this, there is no need to re-check or adjust network resources allocated to existing flows due to the admission of a new flow.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"15 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":"116768192","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

Two approaches to Internet traffic engineering for end-to-end quality of service provisioning 提供端到端服务质量的互联网流量工程的两种方法

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

Kin-Hon Ho, M. Howarth, N. Wang, G. Pavlou, S. Georgoulas

引用次数: 5

Simulation of semi-Markov processes and Markov chains ordered in level crossing 半马尔可夫过程和有序马尔可夫链在水平交叉中的模拟

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

F. Ferreira, A. Pacheco

引用次数: 6

Performance evaluation of short-cut Eulerian routing 捷径欧拉路由的性能评价

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

D. Barth, P. Berthomé, J. Fourneau, C. Laforest, S. Vial

引用次数: 1