发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
A user-level approach to network attached storage 一种用户级的网络附加存储方法
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.145
R. Sohan, S. Hand
{"title":"A user-level approach to network attached storage","authors":"R. Sohan, S. Hand","doi":"10.1109/LCN.2005.145","DOIUrl":"https://doi.org/10.1109/LCN.2005.145","url":null,"abstract":"Modern network attached storage architectures suffer from poor performance, resource management and inflexibility. We examine the problems of current architectures and propose an alternative, built around the precept of doing network storage at user-level. We further examine some of the challenges associated with this unusual approach and provide some preliminary block layer results indicating our architecture results in better performance than current designs","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"95 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":"124730146","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
Rapidly recovering Ethernet networks for delivering broadband services on the train 快速恢复以太网网络，以便在列车上提供宽带服务
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.112
F. D. Greve, F. V. Quickenborne, F. Turck, I. Moerman, P. Demeester
{"title":"Rapidly recovering Ethernet networks for delivering broadband services on the train","authors":"F. D. Greve, F. V. Quickenborne, F. Turck, I. Moerman, P. Demeester","doi":"10.1109/LCN.2005.112","DOIUrl":"https://doi.org/10.1109/LCN.2005.112","url":null,"abstract":"With the currently emerging trials for Internet solutions on the train, it is a matter of time before best-effort Internet on the train becomes a reality. However, designing the aggregation network which transports data from fast moving users to service providers, requires extended research because an aggregation network responsible for the reliable transport of broadband multimedia traffic has not been studied before. We propose a flexible recovery strategy for Ethernet networks with dynamic VLANs. It is shown that fast recovery can be achieved in aggregation networks if standard Ethernet protocols are adjusted to co-operate with the fast and efficient link probe mechanism. Additionally a cost-effective design method is presented for networks of realistic size which aims at combining requirements of the commuters (such as end-to-end delay variations) with reliability constraints","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"104 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":"132037987","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}
引用次数: 4
On the performance of reliable server pooling systems 关于可靠的服务器池系统的性能
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.98
T. Dreibholz, E. Rathgeb
{"title":"On the performance of reliable server pooling systems","authors":"T. Dreibholz, E. Rathgeb","doi":"10.1109/LCN.2005.98","DOIUrl":"https://doi.org/10.1109/LCN.2005.98","url":null,"abstract":"Reliable server pooling (RSerPool) is a protocol framework for server redundancy and session failover, currently under standardization by the IETF RSerPool WG. While the basic ideas of RSerPool are not new, their combination into one architecture is. Some research into the performance of RSerPool for certain specific applications has been made, but a detailed, application-independent sensitivity analysis of the system parameters is still missing. The goal of this paper, after an application-independent, generic quantification of RSerPool systems and definition of performance metrics for both service provider and user, is to systematically investigate RSerPool's behavior on changes of workload and system parameters to give basic guidelines on designing efficient RSerPool systems","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"138 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":"123229713","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
Redundant Protection Problem in the Hierarchical GMPLS Networks 分层GMPLS网络中的冗余保护问题
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.115
Sung-eok Jeon
{"title":"Redundant Protection Problem in the Hierarchical GMPLS Networks","authors":"Sung-eok Jeon","doi":"10.1109/LCN.2005.115","DOIUrl":"https://doi.org/10.1109/LCN.2005.115","url":null,"abstract":"The generalized multiprotocol label switching (GMPLS) networks possess a hierarchical structure, and each layer has its own independent protection mechanism. Thus, there is redundant protection due to the survivability mechanism at each layer. Among many proposed solutions on the redundant protection problem, the common pool method is considered as the most representative one. However, the common pool method cannot cope with two link failures. With a proposed method, the common pool method can be extended to cope with two link failures with a small cost","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"3 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":"121666062","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 memory efficient, 100 Gb/sec MAC classification engine 内存效率高，100 Gb/秒的MAC分类引擎
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.9
Vassilis D. Papaefstathiou, I. Papaefstathiou
{"title":"A memory efficient, 100 Gb/sec MAC classification engine","authors":"Vassilis D. Papaefstathiou, I. Papaefstathiou","doi":"10.1109/LCN.2005.9","DOIUrl":"https://doi.org/10.1109/LCN.2005.9","url":null,"abstract":"In this paper, we propose a classification engine employed at Ethernet's MAC Layer which uses an innovative hashing scheme and internal replacement of MAC vendor IDs; the hash based classification engine (HBCE) compacts the MAC address tables and supports extremely high speed decisions. Its very low memory requirements make it a very promising candidate for Ethernet equipments that would need to support classification at data link layer and at multi-Gigabit per second network speeds. Moreover HBCE can also so be used very efficiently in lower-bandwidth wireless environments","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"23 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":"123798993","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}
引用次数: 4
Dynamic routing of reliability-differentiated connections in WDM optical networks WDM光网络中可靠性差分连接的动态路由
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.57
P. Ma, Luying Zhou, G. Mohan
{"title":"Dynamic routing of reliability-differentiated connections in WDM optical networks","authors":"P. Ma, Luying Zhou, G. Mohan","doi":"10.1109/LCN.2005.57","DOIUrl":"https://doi.org/10.1109/LCN.2005.57","url":null,"abstract":"Protection schemes for WDM mesh networks are typically based on the single-failure scenario. However, the single-failure model is not realistic since the failure of network components is probabilistic. On the other hand, different applications or end users need different levels of fault tolerance. In this work, we assume a probabilistic failure environment and choose the connection reliability as a parameter to denote the level of fault tolerance. We propose a partial segment-based protection approach to accommodate lightpath requests according to their differentiated reliability requirements. We also consider incorporating backup sharing in such an environment. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed scheme. Simulation results show that establishing connections according to their differentiated reliability requirements can effectively improve network blocking performance and the proposed partial segment-based protection scheme outperforms the partial path-based protection scheme proposed in the literature in terms of connection blocking probability","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"80 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":"134575271","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}
引用次数: 4
Dynamic Programming QoS-based Classification for Links with Limited Service Levels 基于qos的有限服务水平链路动态规划分类
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.56
A. Mohamed, H. Alnuweiri
{"title":"Dynamic Programming QoS-based Classification for Links with Limited Service Levels","authors":"A. Mohamed, H. Alnuweiri","doi":"10.1109/LCN.2005.56","DOIUrl":"https://doi.org/10.1109/LCN.2005.56","url":null,"abstract":"We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels. Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS label-switched-paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small number of service levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources are measured by the service-quantization-overhead which is the summation of the differences between the required QoS and the offered service level for all traffic streams. We formulate the classification as a dynamic-programming problem. We then present a group of polynomial-time-algorithms to obtain the optimal classification for soft and hard QoS requirements. We also present the concept of \"differentiation factor\" and show the effect of this factor on minimizing the quantization-overhead","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"515 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":"131742615","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
Simulated annealing based localization in wireless sensor network 基于模拟退火的无线传感器网络定位
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.125
A. Kannan, Guoqiang Mao, B. Vucetic
{"title":"Simulated annealing based localization in wireless sensor network","authors":"A. Kannan, Guoqiang Mao, B. Vucetic","doi":"10.1109/LCN.2005.125","DOIUrl":"https://doi.org/10.1109/LCN.2005.125","url":null,"abstract":"In sensor networks, the information obtained from sensors are meaningless without the location information. In this paper, we propose a simulated annealing based localization (SAL) scheme for wireless sensor networks. Simulated annealing (SA) is used to estimate the approximate solution to combinatorial optimization problems. The SAL scheme can bring the convergence out of the local minima in a controlled fashion. Simulation results show that this scheme gives accurate and consistent location estimates of the nodes","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"25 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":"116803393","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}
引用次数: 97
No junk, no peeking, serious offers only: P2P file exchange in wireless ad-hoc networks 没有垃圾，没有偷看，严肃的只提供:P2P文件交换在无线自组织网络
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.94
Ryan Vogt, I. Nikolaidis, P. Gburzynski
{"title":"No junk, no peeking, serious offers only: P2P file exchange in wireless ad-hoc networks","authors":"Ryan Vogt, I. Nikolaidis, P. Gburzynski","doi":"10.1109/LCN.2005.94","DOIUrl":"https://doi.org/10.1109/LCN.2005.94","url":null,"abstract":"We consider the problem of anonymous file exchange in wireless ad-hoc networks. We propose a new protocol, dubbed RASH (roam and share), to address the problem. RASH is a peer-to-peer (P2P) protocol which fulfills three objectives: (a) protection of user privacy (understood as the confidentiality of their interests), (b) support for a high degree of file authentication and integrity (to reduce or eliminate false downloads and spoofs), and (c) enforcement of reciprocity (to remove freeloaders from the system). The environment of our scheme is purely ad-hoc, in that it does not assume pre-established trust, fixed-infrastructure, or the existence of specialized nodes","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"108 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":"124140226","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
On the feasibility of utilizing correlations between user populations for traffic inference 利用用户群之间的相关性进行流量推断的可行性
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.97
Kun-Chan Lan, J. Heidemann
{"title":"On the feasibility of utilizing correlations between user populations for traffic inference","authors":"Kun-Chan Lan, J. Heidemann","doi":"10.1109/LCN.2005.97","DOIUrl":"https://doi.org/10.1109/LCN.2005.97","url":null,"abstract":"Network models today are often derived from two different methods. On one hand, detailed traffic models are generated based on traces from a single tap into the network. Alternatively, one can collect higher-level traffic-matrix data with SNMP from many routers. However, inferring flow-level details from such data is still an open research issue. Today it is infeasible to collect a fine-grained, packet-level representation of a complete, multi-router network. Even if it were economically feasible to synchronize and monitor every router in a large network, the amount of data generated would tax storage and computation resources. In this work, we propose a methodology to infer flow-level traffic across a network by exploiting the correlations between user populations across different networks. The contribution of this paper is twofold. First, based on traces of Web traffic collected from two different sources, we observe that the user-behavior parameters of the traffic (such as user \"think\" time in Web traffic) are correlated across time, while the application-specific parameters of the traffic (such as object size) are correlated across \"similar\" networks. Second, by utilizing the correlations between similar networks, we propose a methodology for inferring traffic at places where continuously taking measurements is infeasible. We evaluate the effectiveness of our methodology via simulation","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"15 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120852004","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书