检索结果-内蒙古大学图书馆

International Conference on computer Communications and Networks (ICCCN)

作者： M.T. Frederick P. Datta A.K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

Double link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network design. A significant finding is that designs offering complete dual-failure restorability require almost triple the amount of spare capacity. In this paper, networks are designed to achieve 100% restorability under single link failures, while maximizing coverage against any second link failure in the network. In the event of a single link failure, the restoration model attempts to dynamically find a second alternate link-disjoint end-to-end path to provide coverage against a sequential overlapping link failure. Sub-graph routing (M. T. Frederick et al., Feb. 2003) is extended to provide dual-failure restorability for a network provisioned to tolerate all single-link failures. This strategy is compared with shared-mesh protection. The results indicate that sub-graph routing can achieve overlapping second link failure restorability for 95-99% of connections. It is also observed that sub-graph routing can inherently provide complete dual-failure coverage for ~72-81% of the connections

关键词： Intelligent networks Wavelength division multiplexing WDM networks Optical fiber networks Protection Routing computer networks Optical computing Optical design Laboratories

来源：评论

学校读者我要写书评

暂无评论

Reputation management framework and its use as currency in large-scale peer-to-peer networks

Reputation management framework and its use as currency in l...

引用

International Conference on Peer-to-Peer computing

作者： R. Gupta A.K. Somani Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

We propose a reputation management framework for large-scale peer-to-peer (P2P) networks, wherein all nodes are assumed to behave selfishly. The proposed framework has several advantages. It enables a form of virtual currency, such that the reputation of nodes is a measure of their wealth. The framework is scalable and provides protection against attacks by malicious nodes. The above features are achieved by developing trusted communities of nodes whose members trust each other and cooperate to deal with the problem of nodes' selfishness and possible maliciousness.

关键词： Intelligent networks Large-scale systems Peer to peer computing computer network management Protection engineering management Protocols computer networks Laboratories Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A novel packet marking scheme for IP traceback

A novel packet marking scheme for IP traceback

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： B. Al-Duwairi G. Manimaran Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

Recently, several schemes have been proposed for IP traffic source identification for tracing denial of service (DoS) attacks. Most of these schemes require very large number of packets to conduct the traceback process, which results in lengthy and complicated procedure. In this paper, we address this issue by proposing a scheme, called probabilistic pipelined packet marking (PPPM), which employs the concept of "pipeline" for propagating marking information from one marking router to another so that it eventually reaches the destination. The key benefit of this pipeline process lies in drastically reducing the number of packets that is required for the traceback process. We evaluate the effectiveness of the proposed scheme for various performance metrics through combination of analytical and simulation studies. Our studies show that the proposed scheme offers high attack source detection percentage, and attack source localization distance of less than two hops under different attack scenarios.

关键词： computer crime Web and internet services computer networks Laboratories Telecommunication traffic Pipelines Measurement Performance analysis Analytical models Availability

来源：评论

学校读者我要写书评

暂无评论

Optimal light trail design in WDM optical networks

Optimal light trail design in WDM optical networks

引用

IEEE International Conference on Communications (ICC)

作者： Jing Fang Wensheng He A.K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

The enabling technology for supporting IP centric traffic over optical transport networks evolves as the amount of traffic grows. In this paper, we first review a recently proposed concept called light trails. Light trails can enable high speed provisioning, accommodate multigranularity traffic, support high data rates and offer a good candidate for carrying IP traffic over optical networks. Next, we focus on light trail design. We propose a two-step approach for solving the light trail design problem. The first step is called traffic matrix preprocessing, it divides single long hop paths into several shorter paths that satisfy the hop-length constraint. In the second step, the light trail design problem is formulated as an integer linear programming (ILP) optimization problem. The results obtained from our experiments show that the resulting light trail network has high wavelength utilization.

关键词： Optical design Intelligent networks Wavelength division multiplexing WDM networks Optical fiber networks Telecommunication traffic High speed optical techniques Optical buffering Bandwidth computer networks

来源：评论

学校读者我要写书评

暂无评论

Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks

Diverse routing for shared risk resource groups (SRRG) failu...

引用

International Conference on Broadband Networks (BroadNets)

作者： P. Datta A.K. Somani Dependable Computing & Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. Multiple link failure models, in the form of shared-risk link groups (SRLG's) and shared risk node groups (SRNG's) are becoming critical in survivable optical network design. We classify both these form of failures under a common heading of shared-risk resource groups (SRRG) failures. In our research, we propose graph transformation techniques for tolerating multiple failures arising out of shared resource group (SRRG) failures. Diverse routing in such multi-failure scenario essentially necessitates finding out two paths between a source and a destination that are SRRG disjoint. The generalized diverse routing problem has been proved to be NP-complete. The proposed transformation techniques however provide a polynomial time solution for certain restrictive failure sets. We study how restorability can be achieved for dependent or shared risk link failures and multiple node failures and prove the validity of our approach for different network scenarios.

关键词： Routing Intelligent networks Wavelength division multiplexing WDM networks Optical fiber networks Protection Physical layer computer networks Optical computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of WDM optical networks with wavelength usage constraint

引用

IFIP TC6/WG6.10 6th Working Conference on Optical Network Design and Modelling, ONDM 2002

作者： Fang, Jing Srinivasan, R. Somani, Arun K. Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA 50011 United States

ISBN: (纸本)9781475760002

Due to power considerations, it is possible that not all wavelengths available in a fiber can be used at a. given time. In this paper, an analytical model is proposed to evaluate the blocking performance of wavelength-routed optical networks with and without wavelength conversion where the usable wavelengths in a fiber is limited to a certain maximum number, referred to *** usage constraint. The effect of the wavelength usage constraint is studied on ring and mesh-torus networks. It is shown that the analytical model closely approximates the simulation results. It is observed that increasing the total number of wavelengths in a fiber is an attractive alternative to wavelength conversion when the number of usable wavelengths in a fiber is maintained the same. © 2003 by Springer Science+Business Media Dordrecht.

关键词： Blocking probability

来源：评论

学校读者我要写书评

暂无评论

Timing issues of operating mode switch in high performance reconfigurable architectures

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2913卷 23-33页

作者： Sangireddy, Rama Kim, Huesung Somani, Arun K. Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA 50011 United States

The concept of a reconfigurable coprocessor controlled by the general purpose processor, with the coprocessor acting as a specialized functional unit, has evolved to accelerate applications requiring higher computing power. The idea of Adaptive Balanced computing (ABC) architecture has evolved, where a module of Reconfigurable Functional Cache (RFC) is configured with a selective core function in the application whenever a higher computing resources are required. Initial results have proved that the ABC architecture provides with speedups ranging from 1.04x to 5.0x depending on the application and the speedups in the range of 2.61x to 27.4x are observed for the core functions. This paper further explores the issues of management of RFC, where the impact of various schemes for configuration of core function into the RFC module is studied. This paper also gives a detailed analysis on the performance of ABC architecture for various configuration schemes, including the study of the effect of the percentage of the core function in an entire application over the management of RFC modules. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Reconfigurable architectures

来源：评论

学校读者我要写书评

暂无评论

Sub-graph routing : a novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks

Sub-graph routing : a novel fault-tolerant architecture for ...

引用

International Workshop on Design of Reliable Communication Networks (DRCN)

作者： P. Datta M.T. Frederick A.K. Somani Dependable Computing and Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

Failure resilience is one the desired features of the Internet. Multiple link failure models, in the form of shared-risk link group (SRLG) failures, are becoming critical in survivable optical network design. Most of the traditional restoration schemes are based on the single-failure assumption which is unrealistic. In our research, we propose a novel survivability approach that can tolerate multiple failures arising out of SRLG situations. Each network has a set of sub-graphs that can be created by removing each of the links in the network and, in addition, removing all of the links of a SRLG. Connections in the newly proposed strategy are accepted if they can be routed in all the sub-graphs, and are protected against all single link and SRLG failures. We also study how restorability can be achieved for node failures and analyze the performance of our approaches for different network topologies. Our proposed restoration architecture requires the storage of network state information corresponding to each of the possible failure scenarios defined by the subgraphs. This restoration model is novel and can be implemented in current WDM backbone networks.

关键词： Routing Fault tolerance Wavelength division multiplexing WDM networks Optical fiber networks Resilience Internet Optical design Protection Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Application-specific computing with adaptive register file architectures

Application-specific computing with adaptive register file a...

引用

International Conference on Application Specific Systems (ASAP), Architectures and Processors

作者： R. Sangireddy A.K. Somani Dependable Computing and Networking Laboratory Department of Electrical & Computer Engineering Iowa State University Ames IA USA

The demand for higher computing power to effectively execute compute-intensive functions and thus more on-chip computing resources is ever increasing. On the other hand, applications that demand larger on-chip memory bandwidth are continuously emerging. We propose adaptive register file computing (ARC) unit, a novel on-chip processing element that leverages application-specific processing capabilities. The ARC unit supplements a conventional register file to provide large memory bandwidth, or acts as a configurable computing unit to provide higher on-chip computing capacity, depending on the requirement of a specific application. When an out-of-order 8-wide issue superscalar processor is supplemented with the ARC unit to process matrix multiplication, a compute-intensive core function in most multimedia applications, results show a performance increase of up to 12%. Similarly, a 9% performance enhancement is seen when the matrix multiplication is performed in an out-of-order 4-wide issue superscalar processor supplemented with the ARC unit. We also discuss the microarchitecture level details for the implementation of the ARC unit.

关键词： computer applications Registers computer architecture

来源：评论

学校读者我要写书评

暂无评论

Achieving fairness in distributed scheduling in wireless ad-hoc networks

Achieving fairness in distributed scheduling in wireless ad-...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： A.K. Somani Jianwei Zhou Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

Fairness is an important design criterion for medium access control protocol in multihop wireless networks. It is a complex problem due to its many dimensions that include consideration of location-dependent contention, spatial reuse of channels, and desire to achieve fully distributed scheduling in the wireless communication systems. This paper presents a localized and fully distributed algorithm with fair scheduling in multihop wireless networks. The proposed algorithm incorporates start time fair queuing (STFQ) into the distributed coordination function (DCF) in IEEE 802.11. Our algorithm accounts for the services that have already been received by the sender to adjust the backoff timer to ensure that every flow gets a fair service. We propose a simple data structure that every node (sender or receiver) needs to maintain and an update mechanism that achieves fairness. We illustrate through simulations that the proposed algorithm achieves the desired fairness.

关键词： Intelligent networks Ad hoc networks Spread spectrum communication Wireless networks Job shop scheduling Access protocols Media Access Protocol Wireless application protocol Personal digital assistants computer networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：