2008 Next Generation Internet Networks最新文献

Measurements on the Feasibility of TCP NAT Traversal in Cellular Networks 蜂窝网络中TCP NAT穿越可行性的测量

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.42

L. Makinen, J. Nurminen

引用次数: 14

Resource Efficient Grooming Policy in Groomable WDM Mesh Networks 可梳理WDM网状网络中的资源高效梳理策略

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.8

Huaxiong Yao, Yan Yang, Xiansi Tan

{"title":"Resource Efficient Grooming Policy in Groomable WDM Mesh Networks","authors":"Huaxiong Yao, Yan Yang, Xiansi Tan","doi":"10.1109/NGI.2008.8","DOIUrl":"https://doi.org/10.1109/NGI.2008.8","url":null,"abstract":"This paper addresses the traffic grooming problem in wavelength-division multiplexing (WDM) mesh networks. We first introduce a transceiver saving auxiliary graph model, in which various grooming policies can easily be achieved by assigning weight values for various edges. Then we propose a resource efficient grooming policy (REGP) based on the graph model, which take into account the wavelength constraint and transceiver constraint simultaneously according to the correlation between them while other policies consider only one between them. The REGP policy can apply to dynamic traffic and static traffic. In dynamic traffic scenario, REGP utilizes network resources efficiently according to the ratio of the available number of two resources. In static traffic scenario, REGP chooses the most economical routing path according to the cost ratio between the two resources. Simulation results validate that REGP reduces the blocking probability for dynamic traffic and saves the total network cost for static traffic. Results also show that REGP always has a better performance than other policies in various conditions, static traffic, dynamic traffic and various resource deployments.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115203835","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

Near-Optimal Load Balancing in Dense Wireless Multi-Hop Networks 密集无线多跳网络中的近最优负载均衡

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.31

E. Hyytia, J. Virtamo

{"title":"Near-Optimal Load Balancing in Dense Wireless Multi-Hop Networks","authors":"E. Hyytia, J. Virtamo","doi":"10.1109/NGI.2008.31","DOIUrl":"https://doi.org/10.1109/NGI.2008.31","url":null,"abstract":"We consider the load balancing problem in wireless multi-hop networks. In the limit of a dense network, there is a strong separation between the macroscopic and microscopic scales, and the load balancing problem can be formulated as finding continuous curves (\"routes\") between all source-destination pairs that minimize the maximum of the so-called scalar packet flux (\"traffic load\"). In this paper we re-formulate the problem by focusing entirely on the so-called d-flows (vector flow field of packets with a common destination x) and by looking at the equation these flows have to satisfy. The general solution to this equation can be written in terms of a single unknown scalar function, psi(r, x), related to the circulation density of the d-flow, for which function the optimization task can be presented as a problem of variational calculus. In this approach, we avoid completely dealing with systems of paths and calculating the load distribution resulting from the use of a given set of paths. Once the optimal solution for psi(r, x) is found the corresponding paths are obtained as the flow lines of the d-flows. In the example of a unit disk with uniform traffic demands we are able to find a set of paths which is considerably better than any previously published results, yielding a low maximal scalar flux and an extraordinarily flat load distribution. We further illustrate the methodology for a unit square with comparable improvements achieved.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128517887","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

Three Methods for Optimizing Single-Shortest Path Routing 单最短路径路由优化的三种方法

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.15

M. Dzida, M. Zagozdzon, M. Żotkiewicz, M. Pettersson, M. Pióro, M. Duelli, M. Menth

{"title":"Three Methods for Optimizing Single-Shortest Path Routing","authors":"M. Dzida, M. Zagozdzon, M. Żotkiewicz, M. Pettersson, M. Pióro, M. Duelli, M. Menth","doi":"10.1109/NGI.2008.15","DOIUrl":"https://doi.org/10.1109/NGI.2008.15","url":null,"abstract":"Intra-domain routing in IP networks is based on the shortest path principle by assigning administrative weights (costs) to links. The resulting least-cost paths determine routes between pairs of routers. If several such equal-cost paths exist between a pair of routers, it may not be clear which of them is actually used to route traffic. This makes it difficult to predict the network traffic flow distribution. Therefore, the selected link costs should assure uniqueness of the shortest paths. On top of that, the link costs can be optimized with respect to some traffic objective. The resulting optimization problem, referred to as SSPP, turns out to be NP-hard. SSPP can be formulated as a mixed-integer programming problem and, as such, solved with branch-and- bound (B&B). In this paper, we consider three methods for SSPP. Two of them are exact methods based on B&B, namely branch- and-cut and constraint programming. Since the exact solutions of SSPP may require excessive computation time and may not always be effective when applied to practical networks, we also study a fast heuristic method. Finally, in a numerical study, we compare the effectiveness of the three approaches.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133599644","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

Resource Adaptation for Continuous Profit Optimization in Overlay and Virtual Networks 覆盖和虚拟网络中持续利润优化的资源自适应

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.24

C. Tran, Z. Dziong

引用次数: 3

Reputation Management for DHT-Based Collaborative Environments 基于dht的协作环境的声誉管理

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.49

N. Fedotova, L. Veltri

引用次数: 7

Improved CSMA/CA Protocol for IEEE 802.11 IEEE 802.11改进的CSMA/CA协议

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.40

A. Zúquete

引用次数: 9

BitTorrent Based Solution for Efficient Content Sharing on Next Generation Networks 下一代网络中基于BitTorrent的高效内容共享解决方案

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.47

P. Ekler, I. Dévai, B. Bakos, A. Kiss

引用次数: 0

CoV(t)-based Traffic and Queuing Modeling 基于CoV(t)的流量与排队建模

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.44

L. Noirie, G. Post

{"title":"CoV(t)-based Traffic and Queuing Modeling","authors":"L. Noirie, G. Post","doi":"10.1109/NGI.2008.44","DOIUrl":"https://doi.org/10.1109/NGI.2008.44","url":null,"abstract":"Accurate performance evaluation and network dimensioning are required for the design and the deployment of new telecommunication networks based on packet-switching technologies (e.g., Ethernet, IP, G/T-MPLS, etc.). In this context, network engineers need simple, efficient and realistic traffic models. In this paper we investigate traffic modeling based on the coefficient of variation CoV(t) of the data rate observed at different time scales t. We derive a simplified CoV(t)-based traffic model, the novelty being that it requires only four parameters easily tunable with the following characteristics: the mean-rate mu, the link capacity C constraining the traffic, the Hurst parameter H and the transition time scale t0 linked to the burst duration. Confronted to some real traffic traces, our model proves to be accurate. We illustrate how to use it in analytical performance calculation by applying it to the \"ideal switch\" case: thanks to our four-parameter simple model, one can derive formulas for node performance estimation or dimensioning. Finally, we propose a new fitting procedure that automatically translates the four-parameter traffic model of this paper into a superposition of Markov fluid ON-OFF sources, and that is simpler than already existing fitting procedures. This superposition can be used to generate traffic for packet switch simulations, simplifying the set-up of the test traffic to the specification of the four parameters we mentioned above.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126681538","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}

引用次数: 3

Optimal p-Persistent MAC Algorithm for Event-Driven Wireless Sensor Networks 事件驱动无线传感器网络的最优p-Persistent MAC算法

2008 Next Generation Internet Networks Pub Date : 2008-04-28 DOI: 10.1109/NGI.2008.34

J. Vales-Alonso, E. Egea-López, M. Bueno-Delgado, J. L. Sieiro-Lomba, J. García-Haro

引用次数: 5