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

Dynamic routing among several intermittently available servers 几个间歇可用的服务器之间的动态路由

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

S. Martin, I. Mitrani, K. Glazebrook

引用次数: 6

Sojourn times in finite-capacity processor-sharing queues 有限容量处理器共享队列中的逗留时间

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

S. Borst, O. Boxma, N. Hegde

引用次数: 35

Multi-layer bandwidth recovery for multimedia communications: an experimental evaluation 多媒体通信的多层带宽恢复:实验评估

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

L. Valcarenghi, L. Rossi, F. Paolucci, P. Castoldi, F. Cugini

引用次数: 2

Bandwidth allocation and pricing for telecommunications network 电信网络带宽分配与定价

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

J. Joutsensalo, A. Viinikainen, Timo Hämäläinen, Mika Wikström

引用次数: 11

Equivalent bandwidth based-study of a multi-service optical network 基于等效带宽的多业务光网络研究

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

M. Sabeur, D. Popa, T. Atmaca

引用次数: 0

A square root formula for the rate of non-persistent TCP flows 非持久TCP流速率的平方根公式

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

F. Baccelli, D. McDonald

引用次数: 11

On-line estimation of the tail index for heavy-tailed distributions with application to WWW-traffic 重尾分布尾指数的在线估计及其在www -流量中的应用

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

N. Markovich

引用次数: 2

A delay-based approach for TCP parallelization 基于延迟的TCP并行化方法

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

Q. Fu, J. Indulska

{"title":"A delay-based approach for TCP parallelization","authors":"Q. Fu, J. Indulska","doi":"10.1109/NGI.2005.1431681","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431681","url":null,"abstract":"TCP parallelization uses multiple virtual TCP connections to transfer data for an application process. The virtual connections can be standard or modified TCP connections. TCP parallelization has been used to effectively utilise bandwidth for data intensive applications. However, its aggressiveness to increase window and reluctance to reduce window tend to be unfair to other traffic in the network. There are solutions tackling this fairness problem. In these solutions, the fairness is achieved at the cost of losing the robustness of TCP parallelization. Other solutions use a single TCP connection to emulate the behaviour of a set of parallel TCP connections and therefore take advantage of the robustness of TCP parallelization and its fairness bias. These approaches can be used to achieve proportional fairness (e.g. MulTCP), or just to give a better throughput. However, such solutions may not be able to achieve the desired results. In this paper, we analyse these solutions and show their potential problems. A delay-based parallelization approach is then suggested to address the fairness concern by decoupling fairness and effectiveness. It shows that the desired fairness can be achieved in presence of congestion while the bandwidth can be effectively used in absence of congestion.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"544 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":"123378843","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

A cooperative approach to interdomain traffic engineering 域间流量工程的合作方法

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

B. Quoitin, O. Bonaventure

{"title":"A cooperative approach to interdomain traffic engineering","authors":"B. Quoitin, O. Bonaventure","doi":"10.1109/NGI.2005.1431700","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431700","url":null,"abstract":"For performance or cost reasons, autonomous systems (AS) often need to control the flow of their incoming interdomain traffic. Controlling its incoming traffic is a difficult task since it often implies influencing ASes on the path. The current BGP-based techniques that an AS can use for this purpose are primitive. Moreover, their effect is often difficult to predict. In this paper, we propose to solve this problem by using Virtual Peerings. A Virtual Peering is an IP tunnel between a border router of a source AS and a border router of a destination AS. This tunnel is established upon request from the destination AS. These tunnels can be negotiated by using backward compatible modifications to the border gateway protocol (BGP). By using Virtual Peerings, the source and destination ASes can achieve various traffic engineering objectives such as traffic-balancing or reducing the latency. A key advantage of our solution is that it does not require cooperation of the intermediate ASes and that it can be incrementally deployed in today's Internet. We then show by simulations that in a load-balancing scenario, a multi-homed AS only needs to request a few dozens of Virtual Peerings to balance its incoming traffic.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"146 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":"126358391","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}

引用次数: 37

Routing and spare capacity assignment for scheduled and random lightpath demands in all-optical networks 全光网络中调度和随机光路需求的路由和备用容量分配

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

M. Koubàa, N. Puech, M. Gagnaire

{"title":"Routing and spare capacity assignment for scheduled and random lightpath demands in all-optical networks","authors":"M. Koubàa, N. Puech, M. Gagnaire","doi":"10.1109/NGI.2005.1431645","DOIUrl":"https://doi.org/10.1109/NGI.2005.1431645","url":null,"abstract":"In this paper we consider working and protection paths for scheduled and random lightpath demands in an optical transport network without wavelength conversion. As the network resources are limited, the objective is to minimize the rejection ratio. To achieve this goal, we use backup multiplexing techniques to minimize the spare resources required to ensure protection. Scheduled lightpath demands (SLDs) are connection demands for which the set-up and tear-down times are known in advance as opposed to random lightpath demands (RLDs) whose date arrival and holding times are not known in advance and that are established on the fly. We propose and implement two routing algorithms to deal with the routing and spare capacity assignment problem for scheduled and random lightpath demands. The former exploits the a priori knowledge of scheduled lightpath demands to compute the routing and spare capacity assignment for the SLDs before considering the RLDs. The latter considers all the demands simultaneously using a sequential algorithm that computes the routing and spare capacity assignment on the fly, that is, demand by demand. We compare the proposed algorithms in terms of the rejection ratio.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"5 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":"129602913","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}

引用次数: 5