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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1-10 订阅

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

详细简洁

排序：

Distributed multi-agent optimization subject to nonidentical constraints and communication delays

Distributed multi-agent optimization subject to nonidentical...

引用

作者： Lin, Peng Ren, Wei Song, Yongduan School of Electronic and Information Engineering Xi'An Jiaotong University China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering University of California Riverside United States Key Laboratory of Dependable Service Computing Cyber Physical Society Ministry of Education Chongqing University China School of Automation Chongqing University China

In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints and communication delays under local communication. Here the agents capable of communicating with their local neighbors are constrained to remain in possibly different closed convex sets and optimize a global objective function composed of a sum of local objective functions, each of which is known to only one agent. First, we consider the case of fixed graphs and show that distributed optimization might not be achieved on general strongly connected directed graphs. Instead, the agents optimize a weighted sum of the local objective functions. Then we consider the case of switching graphs and show that distributed optimization can be achieved when the adjacency matrices are doubly stochastic and the union of the directed graphs is strongly connected among each time interval of a certain bounded length. Furthermore, we consider the case of communication delays, where the delays are mutually independent. It is shown that the distributed optimization problem can be solved by introducing additional delays to the subgradient projection algorithm and the communication delays can be arbitrarily bounded. Finally, numerical examples are included to show the obtained theoretical results. © 2015 Elsevier Ltd. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Efficient protection and grooming architectures for future optical networks

Efficient protection and grooming architectures for future o...

引用

Network Architectures, Management, and Applications VII

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

ISBN: (纸本)9780819480354

Today networks are too cumbersome due to the incoherent integration of various technologies developed over time. Convergence of data, voice and video has caused the retro-fitting of a network to support non-native traffic types and this has led to sub-par performance for every traffic type. Fundamental changes are warranted to support high bandwidth traffic. The network must guarantee end-to-end delivery and provide inherent protection within the physical structure. We propose that the main traffic types of today's applications should be carried using the following features: connection-oriented service, traffic grooming to fill those connection oriented pipes, and forward error recovery with protection provided in the physical, layer. We present some of our research results. © 2009 SPIE-OSA-IEEE.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient protection and grooming architectures for future optical networks

Efficient protection and grooming architectures for future o...

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

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

Today networks are too cumbersome due to the incoherent integration of various technologies developed over time. Convergence of data, voice, and video has caused the retro-fitting of a network to support non-native traffic types and this has led to sub-par performance for every traffic type. Fundamental changes are warranted to support high bandwidth traffic. The network must guarantee end-to-end delivery and provide inherent protection within the physical structure. We propose that the main traffic types of today's applications should be carried using the following features: connection-oriented service, traffic grooming to fill those connection oriented pipes, and forward error recovery with protection provided in the physical layer. We present some of our research results.

关键词： Protection Optical fiber networks Telecommunication traffic Wavelength division multiplexing Optical packet switching WDM networks Bandwidth SONET Peer to peer computing Packet switching

来源：评论

学校读者我要写书评

暂无评论

Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time

Comparison of Protection Mechanisms: Capacity Efficiency and...

引用

IEEE International Conference on Communications (ICC)

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

High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be efficient in terms of capacity utilization, due to the sharing of backup capacity. However, sharing of backup capacity also complicates the restoration process, and leads to slow recovery. Ring-type protection in mesh topology, on the other hand, has the advantage of fast restoration. The p-cycle scheme is the most efficient ring-type protection method in terms of capacity utilization. Recently, the concept of pre-cross-connected protection was proposed to increase the recovery speed of shared path protection. We overview these protection methods and their failure recovery processes. The recovery time of these schemes are compared analytically. To compare the capacity efficiency, we formulate integer programming optimization problems for three protection methods in static traffic scenario, considering wavelength continuity constraint. We investigate the effect of network connectivity on the performance of capacity utilization of the methods by experimenting on topologies with different average nodal degrees.

关键词： Protection WDM networks computer networks Optical computing Optical design Optical fiber networks Network topology Communications Society Helium Laboratories

来源：评论

学校读者我要写书评

暂无评论

Intentional dropping: A novel scheme for SYN flooding mitigation

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

引用

INFOCOM 2006: 25th IEEE International Conference on computer Communications

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

ISBN: (纸本)1424402212

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. ©2005 IEEE.

关键词： Packet loss

来源：评论

学校读者我要写书评

暂无评论

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 Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

11th Pacific Rim International Symposium on dependable computing, PRDC 2005

作者： Heng, Xu Somani, Arun Dependable Computing and Networking Laboratory Electrical and Computer Engineering Iowa State University Ames IA 50011-3060

ISBN: (纸本)0769524923

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.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

IP traffic grooming over WDM optical networks

IP traffic grooming over WDM optical networks

引用

2005 Conference onOptical Network Design and Modelling: Towards the broadband-for-all era, ONDM 2005

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

IP over WDM has emerged as a winning network architecture to facilitate today's IP centric Internet. Although the total amount of bandwidth demands keeps increasing, there still exists a huge gap between the increasing full-wavelength capacity and the existing low-rate IP traffic. Efficiently grooming low-rate traffic stream to high-capacity lightpaths helps to alleviate the bandwidth mismatch, effectively improve the network resource utilization, and reduce the overall network cost. In this paper, we study traffic grooming problem in IP over WDM framework. The problem of minimizing the total number of transmitters and receivers in the networks is formulated as an integer linear programming (ILP) optimization problem. The ILP formulation produces optimal solutions for static traffic demands. However, applying the ILP solution to large and realistic networks is not practical due to its prohibitively large computation time. We therefore develop a heuristic algorithm, namely traffic aggregation algorithm. A significant improvement on wavelength utilization is observed in our experiments when we use our traffic aggregation algorithm. © 2005 IEEE.

关键词： Optical communication

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

作者： He, Wensheng Fang, Jing Somani, Arun K. Dependable Computing and Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IO 50011

ISBN: (纸本)0780394143

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. © 2005 IEEE.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

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...

引用

11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

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

ISBN: (纸本)0769522815

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. © 2005 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：