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

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

作者： Myounghwan Lee John A. Copeland Communications Systems Center Georgia Institute of Technology Atlanta GA USA

WiMAX with wired infrastructure has been popularly deployed. However, due to the high cost of the construction and the maintenance of the infrastructure, researchers have focused their investigations on IEEE 802.16 wireless multi-hop networks with low cost and high scalability. With IEEE802.11e WLANs, which provide user-level QoS support for WLANs, the multi-hop networks of IEEE 802.16 using DiffServ can provide an excellent network architecture for QoS support. In the multi-hop networks, polling services for the bandwidth request and grant play an important role for a QoS guarantee for IEEE 802.11e clients. Thus, we propose an adaptive polling algorithm with differentiation strategy for unicast and multicast polling services in IEEE 802.16 multi-hop networks with IEEE 802.11e WLANs using DiffServ to provide a QoS guarantee. By simulating the polling algorithm and the DiffServ network architecture using the OPNET Modeler and analyzing bandwidth utilization and the number of clients with rejected bandwidth requests, we show that the novel polling algorithm provides excellent QoS support.

关键词： Spread spectrum communication Bandwidth Costs Diffserv networks multicast algorithms WiMAX Scalability Unicast Analytical models Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Virtual Center: A characteristic of minimum power broadcast trees in wireless ad hoc networks

Virtual Center: A characteristic of minimum power broadcast ...

引用

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

作者： Manki Min Bipin C. Neupane Department of Electrical Engineering and Computer Science South Dakota State University Brookings SD USA

In this paper, we explore the structure of optimal solutions of minimum power broadcast tree problem in wireless ad hoc networks and present a new algorithm based on the findings. Our previous work shows that the optimal solutions have common characteristic (Incremental Minimality) which makes it reasonable to design an incremental algorithm to find the minimum power broadcast trees. In this work, we identify one more characteristic (Virtual Center) which complements the incremental minimality. The optimal solutions tend to have a major subtree which can be obtained by an incremental method starting from a center node which may not be the source node of the broadcast. Our finding is about the center node (called as virtual center) and the major subtree (called as virtually centered subtree) rooted at the virtual center. We propose a new algorithm which is based on the concept of virtual center by dynamically changing the center to find the best candidate for the virtual center. The proposed algorithm effectively utilizes the Virtual Center characteristic and the empirical computation results support the validity of the characteristic by superior performance compared to algorithms in literature.

关键词： Broadcasting Mobile ad hoc networks Algorithm design and analysis multicast algorithms Heuristic algorithms Wireless communication Discrete cosine transforms Computer science Power generation Solids

来源：评论

学校读者我要写书评

暂无评论

Stochastic Timing Analysis of the AES Cipher Algorithm over a Correlated Fading Channel

Stochastic Timing Analysis of the AES Cipher Algorithm over ...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Kyungtae Kang Dong Kun Noh Department of Computer Science University of Illinois Urbana-Champaign USA

Broadcast and multicast services (BCMCS) in CDMA2000 wireless telecommunications networks restrict high- quality multimedia services to their intended recipients by encrypting content. The air specification of BCMCS includes the advance encryption standard (AES) block cipher in the security layer of the broadcast protocol suite. We surveyed the AES block cipher algorithm and characterized the time it requires. We also profiled the execution time of each transformation that comprises the AES cipher. Drawing on these results, we proposed a analytic model that can predict the time required to decrypt encrypted contents at a mobile by considering cross-layer information, such as the characteristics of error control using Reed-Solomon coding in the MAC layer and varying conditions of the fading channel in the physical layer. This model will enable us to estimate the buffer size required to ensure seamless multimedia services.

关键词： Stochastic processes Timing Algorithm design and analysis Fading Cryptography multicast algorithms Multimedia communication Communication system security Digital multimedia broadcasting Information analysis

来源：评论

学校读者我要写书评

暂无评论

Unified construction algorithm of network coding in cyclic networks

Unified construction algorithm of network coding in cyclic n...

引用

Asia-Pacific Conference on Communications

作者： Jiaqing Huang Liang Wang Tiyuan Zhang Hui Li Department of Electronics and Information Engineering Hubei Key Laboratory of Smart Internet Tech. Huazhong University of Science and Technology Wuhan China The Key Laboratory of Integrated Microsystems Shenzhen Graduate School Peking University Shenzhen China

ISBN: (纸本)9781424447848

Network coding in cyclic networks may have better performance than network coding in acyclic networks with regard to the multi-unicast scenarios. Harvey et al. showed that network coding in cyclic networks can be strictly better than fractional routing in conservative networks which have widely practical scenarios such as P2P networks. Hence, we motivated investigating how to achieve that better performance of network coding in cyclic networks by a general construction algorithm. Li et al. presented there are four levels for network code in cyclic networks, including basic convolutional network code (BCNC), convolutional dispersion (CD), convolutional broadcast (CB) and convolutional multicast (CM). Subsequently, it is interesting to investigate how to construct all four levels of network coding in cyclic networks. Based on our previous work of construction algorithm of BCNC, we proposed a unified algorithm to construct network coding in cyclic networks using notion of flow set. Our contributions were as follows: (1) we showed insights of the essential difference between two classes(i.e. BCNC and CD/CB/CM) of network codes in cyclic networks. (2) we showed insights how to uniformly handle cycles for these two classes of network codes in cyclic networks by proposing the unified construction algorithm. Here, we used the cycles classifications defined by Barbero et al., including link cycles but flow-acyclic, simple flow cycles and flow knots(simply knots).

关键词： Network coding multicast algorithms Convolutional codes Routing Broadcasting IP networks Laboratories Cost accounting Encoding Kernel

来源：评论

学校读者我要写书评

暂无评论

WDM multicast Tree Construction algorithms for Minimizing Blocking Probability under a Delay Constraint

WDM Multicast Tree Construction Algorithms for Minimizing Bl...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Tsutomu Makabe Toyofumi Takenaka Department of Computer Science Graduate School of Engineering Nihon University Fukushima Japan

We propose novel tree construction algorithms for multicast communication in photonic networks. Since multicast communications consume many more link resources than unicast communications, effective algorithms for route selection and wavelength allocation are required. We propose novel tree construction algorithms called the weighted Steiner tree (WST) algorithm and the composite weighted Steiner tree (CWST) algorithm. Since the proposed Weighted Steiner Tree algorithm takes account of the number of wavelengths available for each link, this algorithm can select those links which have larger number of available wavelengths. By using this link selection technique, this algorithm can accept many more multicast requests than other multicast tree construction algorithms. However, under certain delay constraints, the blocking characteristics of the proposed weighted Steiner tree algorithm deteriorate since some light paths between source and destination use long hops and cannot satisfy the delay constraint. In order to adapt the approach to the delay-sensitive environments, we have devised the composite weighted Steiner tree algorithm comprising the weighted Steiner tree algorithm and the Dijkstra algorithm for use in a delay constrained environment such as an IPTV application. In this paper, we also give the results of simulation experiments which demonstrate the superiority of the proposed composite weighted Steiner tree algorithm compared with the distributed minimum hop tree (DMHT) algorithm, from the viewpoint of the light-tree request blocking probability.

关键词： Wavelength division multiplexing multicast algorithms Delay Photonics multicast communication IPTV Computer science WDM networks Large-scale systems Next generation networking

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for Scheduling Real-Time multicast Flows in Wireless LANs

Approximation Algorithms for Scheduling Real-Time Multicast ...

引用

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

作者： Y. Bejerano D. Lee P. Sinha L. Zhang Bell Laboratories USA Samsung Technology Seoul South Korea CSE Ohio-State University USA

In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challenge for WLANs to efficiently support real-time multicast services. In this paper, we study the problem of efficient scheduling of real-time multicast flows . For mitigating interferences, we allow access-points (APs) to transmit simultaneously only if they are mutually non-interfering and our objective is minimizing the fraction of time used by the APs for servicing the multicast flows. We introduce two multicast strategies, the association strategy for which each user is restricted to receive flows only from its associated AP and the non-association strategy for which a user may also decode transmissions from other APs in its vicinity. Under both strategies, the scheduling problem of minimizing the multicast service time is NP-hard and we propose simple approximation algorithms with provable performance bounds. Our simulations clearly demonstrate that the proposed algorithms yield efficient multicast scheduling.

关键词： Approximation algorithms multicast algorithms Scheduling algorithm Wireless LAN Broadcasting Unicast Interference elimination Frequency conversion Large-scale systems Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

Optimal layered multicast using network coding

Optimal layered multicast using network coding

引用

4th Workshop on Network Coding, Theory and Applications

作者： Si Jingjing Zhuang Bojin Cai Anni Beijing Univ Posts & Telecommun Sch Telecom Engn Beijing 100088 Peoples R China

ISBN: (纸本)9781424416899

We investigate the problem of constructing optimal layered multicast for heterogeneous sink nodes using network coding. Taking the flexibility of layered coding into account, we discuss the optimization problem that determines the optimal layers' bit-rates for layered multicast, and express it into a mathematical formulation. Finding that this formulation is nonlinear and difficult to solve, we reduce it into several equivalent optimization problems and further propose a new optimization scheme. Different from the min-favorable algorithm in existing work, this new scheme is a global-favorable one, which determines the optimal layers' bit-rates based on the max-flows of all sink nodes. Simulation results indicate that this new scheme could achieve the maximum of the aggregate throughput for layered multicast.

关键词： Network coding Throughput multicast algorithms Resource management Aggregates Computer networks Telecommunication network reliability Polynomials Cost function Delay

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for multicast Optimal Partition of QoS with Uncertain Condition

An Algorithm for Multicast Optimal Partition of QoS with Unc...

引用

4th International Conference on Natural Computation (ICNC 2008)

作者： Ma, Jun Xian Univ Finance & Econ Dept Comp Sci Xian 710061 Peoples R China

ISBN: (纸本)9780769533049

The paper considered a framework that resource allocation is based on local QoS restriction at each network link in a certain multicast tree, and each link is associated with a probability function whose value is equal to the probability of the link's resources. An algorithm has been developed to solve the problem of how to partition end-to-end QoS restriction including every member in a multicast group into local restrictions, and the overall security of the multicast tree is maximized

关键词： multicast algorithms Partitioning algorithms Quality of service Additives Routing Computer networks Resource management Tree graphs Probability distribution Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

AN OVERVIEW OF ROUTING OPTIMIZATION FOR INTERNET TRAFFIC ENGINEERING

引用

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS 2008年第1期10卷 36-56页

作者： Wang, Ning Ho, Kin Hon Pavlou, George Howarth, Michael Univ Surrey Ctr Commun Syst Res Dept Elect Engn Guildford GU2 5XH Surrey England Univ Surrey Ctr Commun Syst Res Dept Elect Engn Guildford GU2 5XH Surrey England UCL Dept Comp Sci London WC1E 6BT England

Traffic engineering is an important mechanism for Internet network providers seeking to optimize network performance and traffic delivery. Routing optimization plays a key role in traffic engineering, finding efficient routes so as to achieve the desired network performance. In this survey we review Internet traffic engineering from the perspective of routing optimization. A taxonomy of routing algorithms in the literature is provided, dating from the advent of the TE concept in the late 1990s. We classify the algorithms into multiple dimensions: unicast/multicast, intra-/inter-domain, IP-/MPLS-based and offline/online TE schemes. In addition, we investigate some important traffic engineering issues, including robustness, TE interactions, and interoperability with overlay selfish routing. In addition to a review of existing solutions, we also point out some challenges in TE operation and important issues that are worthy of investigation in future research activities.

关键词： Routing Internet Tellurium Telecommunication traffic multicast algorithms Taxonomy Unicast Robustness Communication system traffic control IP networks

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the Hybrid Bootstrap Mechanism for multicast Routing

Evaluation of the Hybrid Bootstrap Mechanism for Multicast R...

引用

2nd International Symposium on Advanced Networks and Telecommunication Systems

作者： Takabatake, Toshinori Shonan Inst Technol Dept Informat Sci Kanagawa 2518511 Japan

ISBN: (纸本)9781424436002

In this paper, the hybrid bootstrap mechanism for multicast routing in PIM-SM is presented and its performance is evaluated. Since the hybrid bootstrap mechanism consists of distributed and centralized processes, it is called hybrid one. The key for the hybrid method is that the role of a rendezvous point (for short, RP) selection is played in a bootstrap router (BSR), not that a designated router (DR), because the process of the RP-Set distribution is not needed. Especially, the hybrid method finds the RP by communication between the DR and the BSR. Evaluation results show that the hybrid method can reduce efficiently the processing delay about more than 50% by compared with that of the traditional one.

关键词： multicast protocols Delay Internet Routing protocols Data communication Information science Unicast Nominations and elections multicast algorithms Robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：