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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

70 篇 会议
29 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

51 篇 工学
- 37 篇 计算机科学与技术...
- 24 篇 软件工程
- 18 篇 信息与通信工程
- 8 篇 电气工程
- 6 篇 电子科学与技术（可...
- 6 篇 控制科学与工程
- 4 篇 仪器科学与技术
- 3 篇 网络空间安全
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 航空宇航科学与技...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
- 1 篇 安全科学与工程
21 篇 理学
- 11 篇 数学
- 6 篇 物理学
- 4 篇 系统科学
- 3 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 生物学
8 篇 管理学
- 8 篇 管理科学与工程(可...
- 6 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 公共卫生与预防医...
- 1 篇 药学(可授医学、理...
1 篇 军事学

主题

29 篇 computer network...
18 篇 laboratories
15 篇 bandwidth
13 篇 intelligent netw...
12 篇 optical fiber ne...
11 篇 wdm networks
11 篇 protection
11 篇 telecommunicatio...
10 篇 wavelength divis...
9 篇 quality of servi...
8 篇 routing
6 篇 fault tolerance
6 篇 computer archite...
6 篇 real time system...
5 篇 peer to peer com...
5 篇 resource managem...
5 篇 processor schedu...
5 篇 web and internet...
5 篇 ip networks
4 篇 generative adver...

机构

14 篇 state key labora...
11 篇 dependable compu...
7 篇 dependable compu...
6 篇 dependable compu...
6 篇 dependable compu...
4 篇 nanyang technolo...
4 篇 beijing universi...
4 篇 the college of c...
4 篇 the state key la...
3 篇 dependable compu...
3 篇 school of electr...
3 篇 dependable compu...
3 篇 college of compu...
3 篇 dependable compu...
3 篇 beijing laborato...
3 篇 school of automa...
3 篇 department of el...
2 篇 department of co...
2 篇 department of el...
2 篇 center for quant...

作者

21 篇 a.k. somani
15 篇 g. manimaran
12 篇 somani arun k.
10 篇 niyato dusit
6 篇 zhang ping
6 篇 manimaran g.
5 篇 a. striegel
5 篇 du hongyang
5 篇 kang jiawen
4 篇 xiong zehui
4 篇 r. gupta
4 篇 mingzhe chen
4 篇 zhang ruichen
4 篇 r. srinivasan
3 篇 p. datta
3 篇 sihua wang
3 篇 b. al-duwairi
3 篇 jing fang
3 篇 m.t. frederick
3 篇 fang jing

语言

93 篇 英文
7 篇 其他
1 篇 中文

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

共 100 条记录，以下是71-80 订阅

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

详细简洁

排序：

Connection rerouting/network reconfiguration

Connection rerouting/network reconfiguration

引用

International Workshop on Design of Reliable Communication Networks (DRCN)

作者： N. Jose A.K. Somani Dependable Computing and Networking Laboratory (DCNL) Department of Electrical and Computer Engineering Iowa State University Ames IA USA

Optical networks employing wavelength division multiplexing can carry huge volumes of traffic, hence maintaining a high level of service availability is important. This makes fault tolerance an important issue. In general the failed connections need to be rerouted. After a link or node failure, alternate paths for restoration of the failed connections may exist only if the network is reconfigured. In addition to link or node failure scenarios, connection rerouting or network reconfiguration may also prove helpful for accommodating new requests which may otherwise be blocked. Since connections on backbone optical networks, have longer call durations, it is crucial to accommodate new blocked requests through alternate means, instead of blocking them till existing connections terminate and make a path available. These situations make network reconfiguration important. Since most connections plying on todays backbone networks are high data rate connections, it is critical that the connections have minimal disruption times during network reconfiguration. In this paper, we propose a methodology for minimizing the disruption time and the number of disruptions in the network during connection rerouting.

关键词： Optical fiber networks Wavelength division multiplexing Spine Fault tolerance Bandwidth Optical network units Optical fiber cables Time division multiplexing Resource management Routing

来源：评论

学校读者我要写书评

暂无评论

Dynamic routing with partial information in mesh-restorable optical networks

引用

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

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

ISBN: (纸本)9781475760002

Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. Several methods have been proposed for joint optimization of working and spare capacity in survivable optical networks. These techniques are centralized and do not scale well as they rely on per-flow information. This motivates the need for developing a) distributed algorithms with complete information, b) source based algorithms with partial information which can be easily obtained from traffic engineering extensions to routing protocols. In this paper,-we develop dynamic algorithms for source based routing with partial information. The algorithms are classified, based on the path selection approach used for the primary path. We compare the performance of various routing algorithms through simulation studies, based on metrics such as the call blocking probability, average path, length of an accepted connections, capacity redundancy, and effective network utilization. Our studies show that dynamic routing algorithms perform better than static routing algorithms using pre-computed paths even when the path selection in static algorithms is based on optimizing a global network metric. The other interesting observation we make is that the performance improvement of dynamic routing algorithms using K pre-computed paths is significant even for small values of K. © 2003 by Springer Science+Business Media Dordrecht.

关键词： Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

Low-power high-performance adaptive computing architectures for multimedia processing

引用

9th International Conference on High Performance computing, HiPC 2002

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

ISBN: (纸本)3540003037

The demand for higher computing power and thus more onchip computing resources is ever increasing. The size of on-chip cache memory has also been consistently increasing. To efficiently utilize silicon real-estate on the chip, a part of L1 data cache is designed as a Reconfigurable Functional Cache (RFC), that can be configured to perform a selective core function in the media application whenever higher computing capability is required. The idea of Adaptive Balanced computing architecture was developed, where the RFC module is used as a coprocessor controlled by main processor. Initial results have proved that ABC architecture provides speedups ranging from 1.04x to 5.0x for various media applications. In this paper, we address the impact of RFC on cache access time and energy dissipation. We show that reduced number of cache accesses and lesser utilization of other on-chip resources will result in energy savings of up to 60% for MPEG decoding, and in the range of 10% to 20% for various other multimedia applications. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

FARM: A feedback-based adaptive resource management for autonomous hot-spot convergence system 16

FARM: A feedback-based adaptive resource management for auto...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Swaminathan, S. Manimaran, G. Dependable Computing and Networking Laboratory Dept. of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

ISBN: (纸本)0769515738

In this paper, we present a novel and comprehensive resource management solution for the autonomous hot-spot convergence system (AHSCS) that uses sensor web. This solution is in response to a call for solution at the WPDRTS 2002. The proposed solution involves system analysis and design and developing a new resource management methodology, which we call Feedback-based Adaptive Resource Management (FARM). The FARM methodology combines the advantages of feedback control scheduling, path-based scheduling, value-based scheduling, and survivability strategies to provide dependable (predictable, reliable, and secure) services to the AHSCS. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A reliability-aware value-based scheduler for dynamic multiprocessor real-time systems 16

A reliability-aware value-based scheduler for dynamic multip...

引用

16th International Parallel and Distributed Processing Symposium, IPDPS 2002

作者： Swaminathan, S. Manimaran, G. Dependable Computing and Networking Laboratory Dept. of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

ISBN: (纸本)0769515738

The growing needs for building complex real-time applications coupled with advancements in computing technology signify the importance of developing efficient algorithms for dynamic real-time systems. Dynamic real-time systems need to be designed not only to deal with expected load scenarios, but also to handle overloads by allowing graceful degradation in system performance. Value-based scheduling is a means by which graceful degradation can be achieved by executing critical tasks that offer high values/benefits/rewards to the functioning of the system. In value-based scheduling, each task is associated with a reward and penalty that is offered to the system depending on whether the task meets or misses its deadline. Some value-based scheduling defines "performance index" that captures not only the reward/penalty parameters, but also the tradeoff between schedulability and reliability. In this paper, we propose a reliability-aware value-based dynamic scheduling algorithm for multiprocessor real-time systems, whose objective is to maximize the performance index of the system. The proposed scheduler selects a suitable redundancy level for each task so as to increase the performance index of the system. We have conducted simulation studies to evaluate the effectiveness of the proposed scheduler and its variants for a wide range of values of system parameters. Our studies show that the proposed scheduler offers a high "value ratio" (defined with respect to a near-optimal baseline algorithm) for non-trivial task sets. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A case for tree evolution in QoS multicasting

A case for tree evolution in QoS multicasting

引用

International Workshop on Quality of Service

作者： A. Chakrabarti A. Striegel G. Manimaran Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The core-based tree (CBT) multicasting approach provides a scalable solution for large groups for large networks such as the Internet. However, unlike in shortest-path trees, the quality (tree cost) of the CBT may eventually degrade over time due to group dynamics (join/leave). In order to counteract this degradation, the core may be migrated and a new tree constructed. The method of migrating group members from the old core to the new core has a profound impact on the quality of the tree and also on the service disruption experienced by group members. Thus, there exists a trade-off between tree cost and service disruption as higher rate of migration decreases the overall tree cost but results in more service disruption. Chakrabarti and Manimaran (see Proc. IEEE Globecom, 2001) developed the concept of tree migration. In this paper, we develop a new paradigm for tree migration, namely tree evolution. The proposed tree evolution model (Split-based Tree Evolution Protocol (STEP)) provides an elegant solution that strikes a balance between service disruption and tree cost for highly dynamic groups. We compare and contrast the merits of tree evolution versus tree migration. Our simulation studies show that the proposed evolution model demonstrates excellent tree cost and service disruption for highly dynamic groups.

关键词： computer aided software engineering Multicast protocols Routing protocols Costs Quality of service IP networks Scalability computer networks Acceleration Degradation

来源：评论

学校读者我要写书评

暂无评论

FARM: a feedback-based adaptive resource management for autonomous hot-spot convergence system

FARM: a feedback-based adaptive resource management for auto...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： S. Swaminathan G. Manimaran Dependable Computing & Networking Laboratory Department of Electrical and Computer Engineering Iowa State University Ames IA USA

We present a novel and comprehensive resource management solution for the autonomous hot-spot convergence system (AHSCS) that uses sensor web. This solution is in response to a call for solution at the WPDRTS 2002. The proposed solution involves system analysis and design and developing a new resource management methodology, which we call Feedback-based Adaptive Resource Management (FARM). The FARM methodology combines the advantages of feedback control scheduling, path-based scheduling, value-based scheduling, and survivability strategies to provide dependable (predictable, reliable, and secure) services to the AHSCS.

关键词： Resource management Convergence Instruments Processor scheduling Intelligent sensors Low earth orbit satellites Sensor arrays computer networks Geoscience Real time systems

来源：评论

学校读者我要写书评

暂无评论

Analysis of multi-rate traffic in WDM grooming networks

Analysis of multi-rate traffic in WDM grooming networks

引用

International Conference on computer Communications and Networks (ICCCN)

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

Traffic grooming in optical networks employing wavelength division multiplexing has gained prominence due to the prevailing sub-wavelength capacity requirements of users. One approach to achieving wavelength sharing is through time division multiplexing. Connection requests can have a varying number of time slot requirements. Analytical modeling for computing the blocking performance of establishing multi-rate connections in WDM grooming networks involves extensive combinatorial complexity and thus requires prohibitively large state-space for solution. In this paper, we develop an analytical model that employs an approximation to the exact distribution of number of calls of a certain bandwidth requirement on a wavelength. We validate the approximation through simulation results for two different networks that have high and low link-load correlation. It is observed that up to an order of magnitude performance improvement is obtained by improving the grooming capability in the network for calls that require two time slots.

关键词： Telecommunication traffic Wavelength division multiplexing WDM networks Traffic control Analytical models Optical fiber networks Time division multiplexing Performance analysis computer networks Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Request-specific routing in WDM grooming networks

Request-specific routing in WDM grooming networks

引用

IEEE International Conference on Communications (ICC)

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

ISBN: (纸本)0780374002

Sub-wavelength traffic grooming in optical networks has gained significant importance due to the prevailing fractional wavelength traffic requirement of end-users. Dynamic routing schemes improve the performance of WDM grooming networks compared to static routing as they can adapt to changes in the network state. In this paper, the significance of dynamic routing of fractional wavelength traffic based on request characteristics is illustrated. We propose a request-specific routing scheme, called available shortest path routing, and study its performance. The results are compared against other routing schemes that do not use request characteristics in selecting a path. It Is shown that request-specific routing can improve the network performance with respect to utilization and fairness metrics.

关键词： Routing Intelligent networks Wavelength division multiplexing WDM networks Telecommunication traffic Reluctance generators Switches Bandwidth Optical fiber networks Optical fiber communication

来源：评论

学校读者我要写书评

暂无评论

On improving partial information routing with segmented path protection

On improving partial information routing with segmented path...

引用

International Conference on Parallel Processing Workshops (ICPPW)

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

Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. The author previously developed dynamic algorithms for source based routing with partial information (2002). Our studies showed that dynamic routing algorithms perform better than static routing algorithms using precomputed paths even when the path selection in static algorithms is based on optimizing a global network metric. Since we rely on partial information for making dynamic routing decisions, the capacity redundancy in the network is high. In this paper, we propose a dynamic routing algorithm that uses a simple segmented path protection scheme to improve capacity efficiency. We compare the performance of the partial information routing algorithm with and without segmented path protection through simulation studies, based on metrics such as the call blocking probability and capacity redundancy. Our results indicate that with a simple segmentation scheme, the capacity efficiency of partial information routing can be significantly improved, up to 20 to 30% depending on the topology. The capacity savings obtained leads to a modest improvement in call blocking. It is also observed that segmented protection offers better performance as compared to path protection under partial information scenario, which is contrary to the performance obtained with complete information. Hence, it would be a better alternative to employ segmented protection in large networks where obtaining complete network state information is impractical.

关键词： Protection Heuristic algorithms Telecommunication traffic Wavelength routing Optical fiber networks Routing protocols Redundancy Capacity planning Communication cables Optical fiber cables

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共10页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：