The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l最新文献_第4页

Dynamic routing of restorable QoS connections in MPLS networks MPLS网络中可恢复QoS连接的动态路由

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.58

G. Rosenbaum, C. Chou, S. Jha

{"title":"Dynamic routing of restorable QoS connections in MPLS networks","authors":"G. Rosenbaum, C. Chou, S. Jha","doi":"10.1109/LCN.2005.58","DOIUrl":"https://doi.org/10.1109/LCN.2005.58","url":null,"abstract":"In this paper we consider dynamic routing of restorable quality of service (QoS) connections in multi-protocol label switched (MPLS) networks under a single link failure model. To route a restorable QoS connection, two link disjoint label switched paths from the ingress to the egress node need to be computed such that both paths comply with the QoS constraints. When looking at QoS constraints like bandwidth guarantee and end-to-end delay bound, the current approach described in the literature converts the end-to-end delay bound into an effective bandwidth in a pre-processing step before computing two link disjoint bandwidth guaranteed paths. We argue that the current approach results in poor network performance and suggest a new approach that exploits the dependency between the end-to-end delay, chosen path and provisioned bandwidth. Thus, the two link disjoint paths are computed dynamically with their respective bandwidths so that they meet both the bandwidth guarantee and the end-to-end delay bound. In this paper, we present a new generic algorithm and two new linear programming formulations that implement the new approach. The two linear programming formulations are not intended to be used in a production environment due to their extensive running times, up to 2.5 minutes on average per request, but rather to benchmark approximation algorithms that in turn can be used in production. Furthermore our experiments show that the network performance improvement when exploiting the dependency between end-to-end delay, chosen path and provisioned bandwidth is substantial","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128899557","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}

引用次数: 8

Proportional fairness for QoS enhancement in IEEE 802.11e WLANs IEEE 802.11e无线局域网中QoS增强的比例公平性

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.110

Jeng-Farn Lee, W. Liao, Meng Chang Chen

引用次数: 19

Filtering of shrew DDoS attacks in frequency domain 基于频域的鼩鼱DDoS攻击过滤

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.70

Yu Chen, K. Hwang, Yu-Kwong Kwok

引用次数: 48

Light-Trail Networks: Design and Survivability 轻轨网络:设计和生存能力

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.84

Srivatsan Balasubramanian, Wensheng He, Arun Kumar Somani

{"title":"Light-Trail Networks: Design and Survivability","authors":"Srivatsan Balasubramanian, Wensheng He, Arun Kumar Somani","doi":"10.1109/LCN.2005.84","DOIUrl":"https://doi.org/10.1109/LCN.2005.84","url":null,"abstract":"The light-trail architecture provides a novel solution to address IP-centric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightweight control protocol, light-trails enable efficient sharing of network resources, support subwavelength traffic and minimize costs. In this work, we investigate network design and survivability issues in such networks in the presence of multi-granularity subwavelength traffic subject to nonbifurcation constraints. We first establish the NP-hardness of the light-trail routing problem by reduction from a Hamiltonian path problem. We propose three heuristics for light-trail network design and study their performance with limited network resources. We observe the effect of tunable and fixed transceiver equipment on network throughput. We observe that our heuristics yield excellent wavelength utilization under moderate to high loads even in the presence of heavily fractional traffic. We propose two additional heuristics for shared and dedicated protection and conclude that with only a modest amount of spare capacity, full protection can be achieved for all single link failures","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129028365","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}

引用次数: 22

S-shaped TCP: A new transport protocol for fast long-distance networ s形TCP:一种新的高速远距离网络传输协议

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.118

M. Nabeshima

引用次数: 0

Guaranteed real-time services over standard switched Ethernet 通过标准交换以太网保证实时服务

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.73

Xing Fan, M. Jonsson

引用次数: 25

A new scheme for interconnecting LANs with label switching bridges 一种利用标签交换网桥实现局域网互连的新方案

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.12

Thierry K. Feuzeu, Bernard A. Cousin

引用次数: 2

Resilience provisioning in provider-based overlay networks 基于提供商的覆盖网络中的弹性配置

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.146

G. Rosenbaum, S. Jha

引用次数: 3

HPEQ A Hierarchical Periodic, Event-driven and Query-based Wireless Sensor Network Protocol HPEQ是一种分层周期、事件驱动和基于查询的无线传感器网络协议

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.75

A. Boukerche, R. Pazzi, R. B. Araujo

{"title":"HPEQ A Hierarchical Periodic, Event-driven and Query-based Wireless Sensor Network Protocol","authors":"A. Boukerche, R. Pazzi, R. B. Araujo","doi":"10.1109/LCN.2005.75","DOIUrl":"https://doi.org/10.1109/LCN.2005.75","url":null,"abstract":"Applications that require fine-grain monitoring of physical environments subjected to critical conditions, such as fire, leaking of toxic gases and explosions, pose a great challenge to sensor network protocols. These networks have to provide a fast, reliable, fault tolerant and energy aware channel for events diffusion, which meets the requirements of query-based, event-driven and periodic sensor networks application scenarios. These requirements have to be met even in the presence of emergency conditions that can lead to node failures and path disruption to the sink. This paper presents HPEQ (hierarchical periodic, event-driven and query-based), a cluster-based routing protocol that groups sensor nodes to efficiently relay the sensed data to the sink. In HPEQ protocol nodes with more residual energy are selected as aggregator nodes that relay data to the sink by uniformly distributing energy dissipation among the nodes, and reducing latency and network data traffic. HPEQ is based on a previous protocol, PEQ, that meets sensor networks requirements for critical conditions surveillance applications. HPEQ uses the publish/subscribe paradigm to disseminate requests across the network. The algorithm was implemented using NS-2 simulator and compared to PEQ and to the directed diffusion paradigm. Important metrics were evaluated showing that the proposed algorithm can be a potential solution to meet constraints and requirements of events delivery in critical conditions monitoring applications","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116391545","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}

引用次数: 70

Achieving stable operation of ad hoc wireless networks with neighbor pre-selection and synchronous route updates 利用邻居预选和路由同步更新实现自组网的稳定运行

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.23

S. Itaya, J. Hasegawa, Akio Hasegawa, P. Davis

引用次数: 11