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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

113 篇 会议
58 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

93 篇 工学
- 56 篇 信息与通信工程
- 40 篇 计算机科学与技术...
- 29 篇 软件工程
- 18 篇 电子科学与技术（可...
- 14 篇 电气工程
- 12 篇 动力工程及工程热...
- 10 篇 控制科学与工程
- 7 篇 光学工程
- 6 篇 仪器科学与技术
- 6 篇 航空宇航科学与技...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 3 篇 生物工程
- 3 篇 网络空间安全
- 2 篇 冶金工程
- 2 篇 土木工程
33 篇 理学
- 17 篇 数学
- 10 篇 物理学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 化学
19 篇 管理学
- 13 篇 管理科学与工程(可...
- 8 篇 工商管理
- 4 篇 公共管理
7 篇 医学
- 4 篇 公共卫生与预防医...
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
4 篇 法学
- 4 篇 社会学
1 篇 经济学
1 篇 教育学
1 篇 军事学

主题

22 篇 bandwidth
17 篇 traffic control
15 篇 telecommunicatio...
12 篇 quality of servi...
11 篇 laboratories
11 篇 channel allocati...
10 篇 delay
8 篇 energy consumpti...
8 篇 optical network ...
8 篇 passive optical ...
8 篇 computer network...
7 篇 fading
7 篇 resource managem...
7 篇 switches
6 篇 computer science
6 篇 base stations
6 篇 throughput
6 篇 epon
6 篇 protocols
6 篇 broadcasting

机构

25 篇 advanced network...
11 篇 advanced network...
10 篇 state key labora...
5 篇 ieee
5 篇 advanced network...
4 篇 department of co...
4 篇 university centr...
4 篇 karachi pakistan
4 篇 health managemen...
4 篇 department of pu...
4 篇 suraj eye instit...
4 篇 beijing advanced...
4 篇 i-networking lab...
4 篇 advanced network...
4 篇 nec laboratories...
3 篇 department of ph...
3 篇 health systems a...
3 篇 school of electr...
3 篇 biomedical resea...
3 篇 julius centre fo...

作者

34 篇 nirwan ansari
22 篇 n. ansari
20 篇 ansari nirwan
5 篇 yuanqiu luo
5 篇 e. hou
5 篇 tao han
5 篇 yan zhang
4 篇 gang cheng
4 篇 f. richard yu
3 篇 niyato dusit
3 篇 kiani abbas
3 篇 jiang liu
3 篇 mirica andreea
3 篇 dandona rakhi
3 篇 majeed azeem
3 篇 el sayed zaki ma...
3 篇 chattu vijay kum...
3 篇 mohammed shafiu
3 篇 zheng jie
3 篇 dandona lalit

语言

156 篇 英文
11 篇 其他
4 篇 中文

检索条件"机构=Advanced Networking LaboratoryElectrical and Computer Engineering Department"

共 171 条记录，以下是131-140 订阅

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

详细简洁

排序：

Dynamic upstream bandwidth allocation over Ethernet PONs

Dynamic upstream bandwidth allocation over Ethernet PONs

引用

IEEE International Conference on Communications (ICC)

作者： Y. Luo N. Ansari Advanced Networking Laboratory Department of Electrical and Computer EngineeringNew Jersey Institute of Technology University Heights Newark NJ USA

Ethernet passive optical networks (EPONs) are a low-cost:, high-speed solution to the bottleneck problem of the broadband access network. A critical issue of EPONs is the utility of a shared upstream channel among the local users, and thus, an efficient bandwidth allocation mechanism is required in order to facilitate statistical multiplexing among the local network traffics. This paper proposes a dynamic bandwidth allocation scheme, i.e., limited sharing with traffic prediction (LSTP), for the upstream channel sharing. Based on the multipoint control protocol (MPCP) and the bursty traffic prediction, LSTP yields significant performance improvement as compared to other existing proposals.

关键词： Channel allocation Ethernet networks Passive optical networks Optical network units Optical buffering Repeaters Bandwidth Communication system traffic control High speed optical techniques Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive MIMO transmission scheme: exploiting the spatial selectivity of wireless channels

Adaptive MIMO transmission scheme: exploiting the spatial se...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： A. Forenza A. Pandharipande Hojin Kim R.W. Heath Wireless Networking and Communications Group (WNCG) Department of Electrical and Computer Engineering University of Texas Austin TX USA Communications and Networking Lab Samsung Advanced Institute of Technology Suwon South Korea

We present a novel adaptive transmission technique for MIMO systems with the aim to enhancing the spectral efficiency for a target error rate performance and transmit power. This adaptive method employs the condition number of the spatial correlation matrix as an indicator of the spatial selectivity of the MIMO channel. The distribution of the condition number is then used to identify the prevailing channel environment. Depending on the identified channel state, our adaptive algorithm chooses the MIMO transmission method, among spatial multiplexing, D-STTD, and beamforming, which maximizes the spectral efficiency. Performance results show significant gains in throughput and reduced error rate compared to conventional fixed transmission schemes.

关键词： MIMO Adaptive algorithm Switches Error analysis Throughput Wireless communication Array signal processing Robustness Samarium Diversity methods

来源：评论

学校读者我要写书评

暂无评论

An enhanced distributed channel access deficit round-robin (EDRR) access scheme for IEEE 802.11 wireless networks

An enhanced distributed channel access deficit round-robin (...

引用

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)

作者： C. Powell H. Alnuweiri P. Nasiopoulos Advanced Networking Group Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada MidNet Digital Multimedia Laboratory Department of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

IEEE 802.11 wireless LAN is the most popular and most widely deployed Wi-Fi technology in the world. With the explosion in use of wireless networks comes the demand for them to support the latest technologies. Task group E of the 802.11 standard is working on a standard that adds quality of service enhancements in the 802.11 MAC layer by using traffic flows and prioritizing traffic according to what type of application it belongs to. There are, however, some weaknesses in the design that is currently being proposed by the 802.11 standards committee. In this paper, we propose enhancements to the IEEE 802.11 draft standard in an attempt to provide improved quality of service for all traffic priorities. Through our simulations we are able to show that we can do so without negatively affecting the performance of any of the wireless stations in the network or the traffic flows that they contain. Our results show that the proposed scheme provides an attractive and effective mechanism for enhancing the IEEE 802.11 standard.

关键词： Wireless networks Quality of service Telecommunication traffic Wireless LAN Traffic control Streaming media Communication system security Open systems Explosions computer networks

来源：评论

学校读者我要写书评

暂无评论

Electromagnetic coupled fed disk-loaded monopole antenna with multiple shorting pins

Electromagnetic coupled fed disk-loaded monopole antenna wit...

引用

2005 IEEE International Workshop on Antenna Technology: Small Antennas and Novel Metamaterials, IWAT 2005

作者： Jung, Jong-Ho Choo, Hosung Moon, Youngmin Kim, Young-Eil Park, Ikmo Department of Electrical and Computer Engineering Ajou University 5 Wonchon-dong Youngtong-gu Suwon 443-749 Korea Republic of Department of Electronic and Electrical Engineering Hongik University 72 Sangsu-dong Mapo-gu Seoul 121-791 Korea Republic of i-Networking Laboratory Samsung Advanced Institute of Technology 14 Nongseo-ri Kiheung-eup Yongin 449-712 Korea Republic of

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Selective route-request scheme for on-demand routing protocols in Ad hoc networks

引用

4th International Conference on Ad-Hoc, Mobile, and Wireless Networks, ADHOC-NOW 2005

作者： Lee, Seung Jae Youn, Joo Sang Jung, Seok Hyun Lee, Jihoon Kang, Chul Hee Department of Electronics and Computer Engineering Korea University 5-Ka Anam-Dong Sungbuk-Ku Seoul 136-701 Korea Republic of LG Research Center Woomyen-dong Seucho-ku Seoul 137-724 Korea Republic of I-Networking Lab Samsung Advanced Institute of Technology San 14-1 Nongseo-Ri Kiheung-Eup Yongin Kyungki-do 449-712 Korea Republic of

ISBN: (纸本)3540291326

The on-demand routing protocols are appealing because of their lower routing overhead in bandwidth restricted mobile ad hoc networks, compared with Table-driven routing protocol. They introduce routing overhead only in the presence of data packets that need routes. However, the control overhead of on-demand routing protocols is increased by node mobility, node geographic density and traffic pattern density. In fact, this is undesirable feature for the scalable routing protocols whose control overhead should be under control to keep up with increasing offered load. The fundamental cause of these drawbacks is produced by flooding RouteRequest (RREQ) packet. As a solution for such a drawback of current on-demand routing schemes, we propose Selective Request Scheme (SR scheme). In this protocol, the stability of local network can be improved by re-floods or discards RREQ. Therefore in dynamic environment and limited bandwidth, SR Scheme assists in discovery the robust route and reduces the number of flooded RREQ packet. We demonstrate the effectiveness of our enhancement by applying it to Ad hoc On-demand Distance Vector Routing (AODV). Simulation results show that proposed idea significantly reduces the control overhead and improves the performance and scalability of the routing protocols. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

A novel fairness algorithm for resilient packet ring networks with low computational and hardware complexity

A novel fairness algorithm for resilient packet ring network...

引用

IEEE Workshop on Local and Metropolitan Area Networks (LANMAN)

作者： F. Alharbi N. Ansari Advanced Networking Laboratory Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

The resilient packet ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies SONET and Ethernet, respectively. The key performance objectives of RPR is to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffics in achieving these objectives. The RPR fairness algorithm (J. Kao et al., January 2002) is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under the unbalanced traffic scenarios. These oscillations presents a barrier in achieving spatial reuse and high bandwidth utilization. We propose a low complexity fairness algorithm (LCFA) in allocating the bandwidth fairly to RPR nodes with a very low computational complexity O(1) that requires a simple hardware requirement similar to that of the RPR fairness algorithm.

关键词： computer networks Hardware Bandwidth Traffic control SONET Ethernet networks Protection Channel allocation Laboratories USA Councils

来源：评论

学校读者我要写书评

暂无评论

Core-stateless proportional fair queuing for AF traffic

Core-stateless proportional fair queuing for AF traffic

引用

IEEE Conference and Exhibition on Global Telecommunications (GLOBECOM)

作者： Gang Cheng Kai Xu Ye Tian N. Ansari Advanced Networking Laboratory Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Proportional fair queuing is to ensure that a flow passing through the network only consumes a fair share of the network resource that is proportional to its committed rate or other service level agreement (SLA). It is of great importance in Differentiated Services (DiffServ) networks as well as other price incentive network services. In this paper, we propose a simple core-stateless proportional fair queuing algorithm (CSPFQ) for the assured forward (AF) traffic in DiffServ networks. We first develop our algorithm based on a fluid model analysis and then extend it to a realizable packet level algorithm. We prove analytically and instantiate through simulations that our algorithm can achieve proportional fair bandwidth allocation among competing flows without requiring routers to estimate flows' fair share rates. Our simulation results also demonstrate that our algorithm outperforms the weighted core-stateless fair queuing (WC-SFQ) in terms of proportional fairness.

关键词： Traffic control Channel allocation Diffserv networks IP networks Bandwidth Telecommunication traffic Algorithm design and analysis Web and internet services Laboratories Forward contracts

来源：评论

学校读者我要写书评

暂无评论

Extracting attack knowledge using principal-subordinate consequence tagging case grammar and alerts semantic networks

Extracting attack knowledge using principal-subordinate cons...

引用

Conference on Local computer Networks (LCN)

作者： Wei Yan E. Hou N. Ansari Advanced Networking Laboratory Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

The increasing use of intrusion detection systems and a relatively high false alarm rate can lead to a huge volume of alerts. This makes it very difficult for security administrators to analyze and detect network attacks. Our solution for this problem is to make the alerts machine understandable. We propose a novel way to convert the raw alerts into machine understandable uniform streams, correlate the streams, and extract the attack scenario knowledge. The modified case grammar principal-subordinate consequence tagging case grammar and the 2-atom alert semantic network are used to generate the attack scenario classes. Alert mutual information is also applied to calculate the alert semantic context window size. Based on the alert context, the attack scenario instances are extracted and the attack scenario descriptions are forwarded to the security administrator.

关键词： Tagging computer aided software engineering Intrusion detection Data mining Laboratories computer networks Information security IP networks Web and internet services computer crime

来源：评论

学校读者我要写书评

暂无评论

Defending against traffic analysis attacks with link padding for bursty traffics

Defending against traffic analysis attacks with link padding...

引用

Proceedings of the Annual IEEE SMC Information Assurance Workshop (IAW)

作者： W. Yan E. Hou N. Ansari Department of Electrical and Computer Engineering Advanced Networking Laboratory New Jersey Institute of Technology Newark NJ USA

Preventing networks from being attacked has become a critical issue for network administrators and researchers. Even for systems where encryption is used they are still vulnerable to traffic analysis attacks. Attackers can launch catastrophic distributed denial of services attacks based on the critical link information derived from traffic analysis. Link padding can be used to defend against such traffic analysis attacks. In this paper, we propose a robust variant packet sending-interval link padding algorithm for bursty traffics. The histogram feature vector method is used to simulate the traffic analysis attack and principle component analysis is used to test the performance of the algorithm.

关键词： Telecommunication traffic Traffic control Performance analysis Algorithm design and analysis Cryptography computer crime Information analysis Robustness Histograms Analytical models

来源：评论

学校读者我要写书评

暂无评论

Sealahle packet classification through maximum entropy dashing

Sealahle packet classification through maximum entropy dashi...

引用

3rd International IFIP-TC6 networking Conference, networking 2004

作者： Choi, Lynn Heo, Jaesung Kim, Hyogon Joung, Jinoo Kim, Sunil The Department of Electronics and Computer Engineering Korea University Anam-Dong Sungbuk-Ku Seoul Korea Republic of i-Networking Laboratory Samsung Advanced Institute of Technology Giheung-Eup Yongin-ShiGyeonggi-Do Korea Republic of The School of Information and Computer Engineering Hongik University 72-1 Sangsu-Dong Mapo-Gu Seoul Korea Republic of

ISBN: (纸本)9783540246930

In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algorithm hierarchically partitions the rulebase into smaller independent sub-rulebases by employing hashing. By using the same hash key used in the partitioning a classifier only needs to look up the relevant sub-rulebase to which an incoming packet belongs. For an optimal partitioning of rulebases, we apply the notion of maximum entropy to the hash key selection. W e performed the detailed simulations of our proposed algorithm on synthetic rulebases of size lK to 500K entries using real packet traces. The results show that the algorithm can significantly outperform existing classifiers by reducing the size of a rulebase by more than four orders of magnitude with just two-levels of partitioning. Both the space and time complexity of the algorithm exhibit linearity in terms of the size of a rulebase, suggesting a good scalable solution for the packet classification with a large rulebase. © IFIP International Federation for Information Processing 2004.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：