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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

53 篇 会议
1 篇 期刊文献

馆藏范围

54 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

19 篇 工学
- 17 篇 计算机科学与技术...
- 9 篇 软件工程
- 6 篇 信息与通信工程
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 2 篇 网络空间安全
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 安全科学与工程
8 篇 理学
- 6 篇 数学
- 3 篇 物理学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
4 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理

主题

27 篇 computer network...
16 篇 laboratories
14 篇 bandwidth
12 篇 optical fiber ne...
11 篇 wdm networks
11 篇 intelligent netw...
11 篇 protection
10 篇 wavelength divis...
10 篇 telecommunicatio...
7 篇 quality of servi...
6 篇 routing
6 篇 fault tolerance
6 篇 computer archite...
5 篇 peer to peer com...
5 篇 web and internet...
4 篇 application soft...
4 篇 real time system...
4 篇 optical design
4 篇 resource managem...
4 篇 analytical model...

机构

11 篇 dependable compu...
7 篇 dependable compu...
6 篇 dependable compu...
6 篇 dependable compu...
3 篇 dependable compu...
3 篇 dependable compu...
3 篇 dependable compu...
1 篇 dependable compu...
1 篇 dependable compu...
1 篇 department of el...
1 篇 information syst...
1 篇 state key labora...
1 篇 dependable compu...
1 篇 dependable netwo...
1 篇 key laboratory o...
1 篇 real-time comput...
1 篇 dependable compu...
1 篇 the dependable c...
1 篇 dependable compu...
1 篇 network mathemat...

作者

20 篇 a.k. somani
13 篇 g. manimaran
10 篇 somani arun k.
7 篇 manimaran g.
5 篇 a. striegel
4 篇 r. gupta
4 篇 r. srinivasan
3 篇 p. datta
3 篇 b. al-duwairi
3 篇 jing fang
3 篇 m.t. frederick
3 篇 fang jing
2 篇 s. swaminathan
2 篇 sangireddy rama
2 篇 wensheng he
2 篇 kim huesung
2 篇 al-omari r.
2 篇 heng xu
2 篇 srinivasan r.
2 篇 swaminathan s.

语言

54 篇 英文

检索条件"机构=Dependable Computing & Networking Laboratory Dept of Electrical and Computer Engineering"

共 54 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Intentional dropping: a novel scheme for SYN flooding mitigation

Intentional dropping: a novel scheme for SYN flooding mitiga...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

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

This paper presents a novel scheme to mitigate the effect of SYN flooding attacks. The scheme, called intentional dropping based filtering, is based on the observation of client's persistence (i.e., client's reaction to packet loss by subsequent retransmissions) which is very widespread as it is built in TCP's connection setup. The main idea is to intentionally drop the first SYN packet of each connection request. Subsequent SYN packet from a request is passed only if it adheres to the TCP's timeout mechanism. Our analysis shows that the proposed scheme reduces attacker's effective attack rate significantly with an acceptable increase in connection establishment latency.

关键词： Floods Traffic control Web and internet services Bandwidth Access protocols computer crime TCPIP computer networks Filtering Delay

来源：评论

学校读者我要写书评

暂无评论

An intra-task DVS algorithm exploiting program path locality for real-time embedded systems

引用

12th International Conference on High Performance computing, HiPC 2005

作者： Kumar, G. Sudha Anil Manimaran, G. Real-Time Computing and Networking Laboratory Dept. of Electrical and Computer Engineering Iowa State University Ames IA 50011 United States

ISBN: (纸本)3540309365

In this paper, we present a novel intra-task Dynamic Voltage Scheduling (DVS) algorithm based on the knowledge of frequently executed paths in the control flow graph for real-time embedded systems. The basic idea is to construct a common path composing all the frequently executed paths (hot-paths) and perform DVS scheduling based on this common path, rather than the most probable path. We compare the performance (energy consumption) of our algorithm with a recently proposed algorithm. Our simulation results show that the proposed algorithm performs better than the existing algorithm for most of the simulated conditions. We also identify interesting research problems in this context. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Partitioned cache shadowing for deep sub-micron (DSM) regime

Partitioned cache shadowing for deep sub-micron (DSM) regime

引用

Pacific Rim International Symposium on dependable computing

作者： Heng Xu A. Somani Dependable Computing and Networking Laboratory Electrical and Computer Engineering Iowa State University Ames IA USA

An important issue in modern cache designs is bridging the gap between wire and device delays. This warrants the use of more regular and modular structures to mask wire latencies. This paper advances the basic concepts of shadow caching to offer protection against both data corruption and micro-network disruption in partitioned architectures. Network disruption is tolerated by sending shadow packet along a different route than the original packet, whereas the data corruption problem is addressed by reserving a small portion of the overall cache capacity for in-cache shadow space. Our results show that an average of 96% in data error coverage for Spec2K benchmarks can be achieved and more than 99% of the transient faults on the underlying switched micro-network can also be protected while incurring less than 3% performance degradation in most of the above benchmarks.

关键词： Shadow mapping Delay Protection Wire Fault tolerance Personal communication networks computer networks Degradation Error correction codes Laboratories

来源：评论

学校读者我要写书评

暂无评论

A p-cycle based survivable design for dynamic traffic in WDM networks

A p-cycle based survivable design for dynamic traffic in WDM...

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

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

Achieving both high capacity efficiency and fast restoration speed is a primary goal of survivable design in WDM network. The p-cycle method aims to benefit from the fast restoration of ring-like protection and high capacity efficiency of mesh protection. In this paper, we first present a p-cycle based method to deal with dynamic traffic in survivable WDM network design. In this method, we first find an optimal set of p-cycles for the given network topology. Next, we propose three routing strategies for accommodating dynamic requests upon their arrival time. The performance of our p-cycle based design using different routing strategies are compared with that of the shared backup path protection (SBPP). The results show that proposed p-cycle based design method performs better than SBPP in dense networks. Whereas SBPP performs better than the p-cycle based design in sparse networks.

关键词： Telecommunication traffic Intelligent networks WDM networks Protection Routing computer networks Network topology Helium Laboratories Design engineering

来源：评论

学校读者我要写书评

暂无评论

Network selection using fuzzy logic

Network selection using fuzzy logic

引用

International Conference on Broadband Networks (BroadNets)

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

The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterized by large scale, poor reliability, and extreme dynamism of the participating nodes, with a continuous flow of nodes joining and leaving the systems. Selection of an optimal network requires estimation of its rank using attributes such as storage, average load, cost, reliability etc. There are multiple networks, each vying for users business by providing them novel services. The user in turn has to decide which network best meets its service requirements and accordingly join a network. In this paper, we propose a model with two ranking schemes, one being network-specific and the other user-specific. The schemes use fuzzy logic to rank different networks based on their attributes. The difference between the two ranking schemes lie in the dynamism offered by them. The user-specific ranking criteria is flexible while the network-specific scheme uses a fixed criteria. The network-specific scheme helps in providing a structure to visualize the overall performance index of the networks. The user-specific scheme is adaptive in the sense that it caters to the specific needs of the users. The simulations performed by us show that the two schemes are light-weight, highly accurate and easily implementable

关键词： Fuzzy logic Peer to peer computing Grid computing computer networks Distributed computing Image storage Laboratories Large-scale systems computer network reliability Cost function

来源：评论

学校读者我要写书评

暂无评论

Real-time H/W implementation of the approximate discrete Radon transform

Real-time H/W implementation of the approximate discrete Rad...

引用

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

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

The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real time implementation of the discrete RT (DRT) is extremely difficult due to its use of complex trigonometric functions and O(N/sup 3/) time complexity, making its use in video applications difficult. A O(N/sup 2/lgN) approximate discrete (ADRT) has been presented in literature (Brady, 1998) that allows highly parallel computation. This paper presents an architecture that uses the ADRT to create a computation architecture known as the xADRT. Performance analysis indicates that it can achieve a refresh rate of 10 frames per second for use in real time image processing applications.

关键词： Discrete transforms Application software computer architecture Read-write memory computer networks computer graphics Biomedical imaging Concurrent computing Computational complexity Laboratories

来源：评论

学校读者我要写书评

暂无评论

Game theory as a tool to strategize as well as predict nodes' behavior in peer-to-peer networks

Game theory as a tool to strategize as well as predict nodes...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

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

In this paper we use game theory to study nodes' behavior in peer-to-peer networks when nodes receive service based on their reputation. Reputation is used as a mechanism to incentivize nodes to share resources and provide services to others. The probability of a node obtaining service is directly proportional to its current reputation, and the only way to enhance reputation is by serving others. Thus, the problem of free-riding is minimized. Game theory can be used by individual selfish nodes to determine their optimal strategy for participation level in such a system. Moreover, game theory gives us interesting insight into the overall nature of nodes' interactions and system efficiency, and how system efficiency can be improved.

关键词： Peer to peer computing Game theory Intelligent networks computer networks Nash equilibrium Costs Laboratories Electronic mail Network servers Distributed computing

来源：评论

学校读者我要写书评

暂无评论

IP traffic grooming over WDM optical networks

IP traffic grooming over WDM optical networks

引用

International Conference on Optical Network Design and Modeling, ONDM

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

来源：评论

学校读者我要写书评

暂无评论

CompuP2P: a light-weight architecture for Internet computing

CompuP2P: a light-weight architecture for Internet computing

引用

International Conference on Broadband Networks (BroadNets)

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

Internet computing is emerging as an important new paradigm in which resource intensive computing is integrated over Internet-scale networks. Over these large networks, different users and organizations share their computing resources, and computations take place in a distributed fashion. In such an environment, a framework is needed in which the resource providers are given incentives to share their resources. CompuP2P is a light weight architecture for enabling Internet computing. It uses peer-to-peer networks for sharing of computing resources. CompuP2P create dynamic markets of network accessible computing resources, such as processing power, memory storage, disk space, etc., in a completely distributed, scalable, and fault-tolerant manner. This paper discusses the system architecture, functionality, and applications of the proposed CompuP2P architecture. We have implemented a Java based prototype, and our results show that the system is light-weight and can provide almost a perfect speedup for applications that contain several independent compute-intensive tasks

关键词： computer architecture Internet computer networks Peer to peer computing Distributed computing IP networks Grid computing Fault tolerance Prototypes Java

来源：评论

学校读者我要写书评

暂无评论

Evaluating dual-failure restorability in mesh-restorable WDM optical networks

Evaluating dual-failure restorability in mesh-restorable WDM...

引用

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共6页 << < 1 2 3 4 5 6 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：