2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06.最新文献

Protecting servers against DDoS attacks with improved source IP address monitoring scheme 改进源IP监控方案，保护服务器免受DDoS攻击

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678236

H. H. Takada, A. Anzaloni

引用次数: 3

A model for TCP congestion control capturing the correlations in times between the congestion events TCP拥塞控制模型，捕获拥塞事件之间的时间相关性

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678238

Esa Hyytiä, P. Emstad

引用次数: 2

Implicit admission control for a differentiated services network 差异化服务网络的隐式准入控制

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678262

Yuming Jiang, Anne Nevin, P. Emstad

{"title":"Implicit admission control for a differentiated services network","authors":"Yuming Jiang, Anne Nevin, P. Emstad","doi":"10.1109/NGI.2006.1678262","DOIUrl":"https://doi.org/10.1109/NGI.2006.1678262","url":null,"abstract":"Admission control is a crucial network element for providing quality of service (QoS) guarantees in the Internet. In this paper, we propose a novel framework approach, called implicit admission control (iAC), for admission control in a differentiated services (DiffServ) network. In the iAC approach, admission control is performed distributedly at routers. No signaling is needed for exchanging service and traffic information between flows and routers. The service requirement and some coarse traffic information of a flow are carried by packets of the flow. Specifically, the DiffServ field is utilized for this purpose. At each router, admission control for the flow is performed when its first packet is detected. The admission test is based on the service requirement and traffic information carried by the DiffServ field of the packet, as well as the local traffic and resource information. In addition, to simplify admission control, two flow aggregation methods are adopted at each router. One is link-based fair aggregation (LBFA) for the deterministic expedited forwarding (EF) service. The other is dynamic priority based flow aggregation (DPFA) for the statistical assured forwarding (AF) service. Analytical results show that with these flow aggregation approaches, a newly admitted flow does not adversely affect QoS guarantees of existing flows. Consequently, admission test is needed only for the new flow","PeriodicalId":179284,"journal":{"name":"2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133012896","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}

引用次数: 32

On the optimal configuration of metro Ethernet for triple play 三网融合城域以太网的优化配置

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678259

A. Kern, I. Moldován, T. Cinkler

引用次数: 4

Challenges in multi-hop networks 多跳网络中的挑战

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678214

C. Rosenberg

{"title":"Challenges in multi-hop networks","authors":"C. Rosenberg","doi":"10.1109/NGI.2006.1678214","DOIUrl":"https://doi.org/10.1109/NGI.2006.1678214","url":null,"abstract":"Wireless multi-hop networks have generated a lot of interest in the recent past due to their many potential applications. Examples of such networks are sensor, ad hoc, and mesh networks. These networks bring a lot of new challenges; some are linked to the wireless physical layer, some to the end-devices, and some to the multi-hop characteristic. A wireless channel is usually characterized by its broadcast nature, strong path loss, time varying fading and shadowing. Many wireless devices have limited battery and processing power. Multi-hopping implies the existence of many geographically distributed devices that share the wireless medium which creates the needs for efficient MAC and routing protocols to mitigate interference and take full advantage of spatial reuse. The complexity and time-varying attributes of the wireless channel seem to call for cross-layer integration, i.e., the need for the higher layers of the protocol stack to take into account the characteristics of the physical layer. In spite of a vast amount of research on multi-hop networks in the past few years, many fundamental challenges have not been answered. This presentation will ask fundamental questions on 3 of these challenges and bring some elements of response. The first challenge is the design of a fair and efficient MAC protocol. Another one is to find the right level of cross-layer interactions to design schemes that are more efficient while maintaining the robustness and the usability of the system. Another challenge is to understand the fundamental limits of multi-hop networks in realistic scenarios","PeriodicalId":179284,"journal":{"name":"2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06.","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116474854","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}

引用次数: 2

A fault-tolerant protocol for railway control systems 铁路控制系统的容错协议

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678256

Jaime Lloret, F. Sánchez, J. Díaz, J. M. Jiménez

{"title":"A fault-tolerant protocol for railway control systems","authors":"Jaime Lloret, F. Sánchez, J. Díaz, J. M. Jiménez","doi":"10.1109/NGI.2006.1678256","DOIUrl":"https://doi.org/10.1109/NGI.2006.1678256","url":null,"abstract":"Railway control systems are largely based on data communication and network technologies. With the adoption of Ethernet-IP as the main technology for building end-to-end real-time networks on railway control systems, the requirement to deliver high availability, quality and secure services over Ethernet has become strategic. Critical real-time traffic is generally penalized and the maximum restoration time of 50 msec sometimes is exceeded because of real-time applications hangings, so passengers' safety could be committed. It occurs on more than twenty percent of critical fail tests performed. Our main goal is to minimize restoration time from the application point of view. This article describes a protocol to improve critical real-time railway control systems. The algorithm designed gives us fast recoveries when railway computers fail down. The protocol permits to manage the railway control system from every computer in the network mixing unicast and multicast messages. Simulations obtained for a real railway line are shown. We have reached excellent results limiting critical failures recoveries to less than 50 msec","PeriodicalId":179284,"journal":{"name":"2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336713","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

Traffic predictability based on ARIMA/GARCH model 基于ARIMA/GARCH模型的交通预测

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678242

B. Zhou, D. He, Z. Sun

引用次数: 52

Detailed analysis of eDonkey transfers on ADSL ADSL上驴子传输的详细分析

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678249

Louis Plissonneau, Jean-Laurent Costeux, P. Brown

引用次数: 30

A fast and efficient backup routing scheme with bounded delay guarantees 一种具有有界延迟保证的快速高效的备份路由方案

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678252

Enrique Hernández-Orallo, J. Vila-Carbó

引用次数: 1

Grade of service balancing for originating and handoff calls and system cost minimization using genetic algorithm 基于遗传算法的初始呼叫和切换呼叫的服务平衡等级和系统成本最小化

2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06. Pub Date : 2006-08-28 DOI: 10.1109/NGI.2006.1678226

S. Fakoorian, H. Taheri

{"title":"Grade of service balancing for originating and handoff calls and system cost minimization using genetic algorithm","authors":"S. Fakoorian, H. Taheri","doi":"10.1109/NGI.2006.1678226","DOIUrl":"https://doi.org/10.1109/NGI.2006.1678226","url":null,"abstract":"With the increasing popularity of mobile wireless communication systems, customers are expecting the same quality of service (QoS), availability and performance from the wireless communication networks as the traditional wire-line networks. Currently the research work on radio channel allocation in cellular mobile systems focuses mainly on two aspects, improving the user admission capability and protecting the connection continuity for handoff calls as a QoS constraint. However, given a QoS constraint, a wireless network has to sacrifice its capacity in order to support an increase in handoff rate. In this paper, we propose and analyze a different handoff scheme which not only gives priority to handoff calls, due to importance of them from QoS standpoint, but also protects originating calls to keep system capacity at an acceptable level. We will describe the optimum design of our scheme to minimize the system cost. We use genetic algorithm (GA) to solve optimum design problem. To do so, a model of cost characteristics has been derived for the proposed scheme. Indeed, the robustness of our approach is that analytically minimizes the system cost. We use a system model defined by a two dimensional Markov chain which computes mathematically the performance in terms of the blocking probability of originating calls, forced termination probability and call incompletion probability. Results are compared with conventional guard channel (GC) scheme","PeriodicalId":179284,"journal":{"name":"2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121004110","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