Resource allocation in communication networks using abstraction and constraint satisfaction

The fundamental issue of quality-of-service (QoS) routing has triggered a lot of research during the last few years. However, the proposed algorithms attempt to route communication demands only on a call by call basis, without taking into account future traffic. There are nonetheless cases where the traffic profile is known. In this paper, we address this related problem to QoS routing, more specifically, the off-line planning of bandwidth allocation to demands known in advance. Shortest-path routing is the traditional technique applied to this problem. However, this can lead to poor network utilization and even congestion. We show how an abstraction technique combined with systematic search algorithms and heuristics derived from artificial intelligence make it possible to solve this problem more efficiently and in much tighter networks, in terms of bandwidth usage. In addition, this abstraction technique also allows to explain during search why some allocation problems are indeed infeasible. Then, the network regions between which bandwidth must be added are then identified.     

Context awareness in network selection for dynamic environments

Mobile devices of new generation are able to connect to multiple networks and to constitute new infrastructureless networks. These dynamic environments require new security paradigms and automatic mechanisms to minimize user intervention. Our goal is the definition of a new concept of distance that considers the current domain constraints and the user preferences. This paper addresses some of the problems of these complex environments by using Multidimensional Scaling (MDS) techniques. We also propose collaborative mechanisms for automatic environment marking. Based on these ideas we have developed Pervasive Interaction Manager (PervsIM), a decision mechanism that selects the most appropriate network or peer to interact with. Besides we have defined an embedded access control module which ensures that PervsIM decisions are followed by all applications. Furthermore, several simulation results and implementation details outline how these results can be incorporated in today’s mobile devices.     

A Viterbi-like algorithm with adaptive clustering for channelassignment in cellular radio networks

A new channel assignment algorithm, called the Viterbi (1967) -like algorithm (VLA), is proposed to solve the channel assignment problem in cellular radio networks. The basic idea of the proposed algorithm is step-by-step (sequential) channel assignment with the objectives of minimum bandwidth required at every step, subject to adjacent channel and cochannel separation constraints. The VLA provides the benefits of minimum required bandwidth, stability of solution, and fast execution time. The performance of the VLA is evaluated by computer simulation, applied first to 19 benchmark problems on channel assignment and then applied to study cellular radio network performance. Results from computer simulation studies show that bandwidth requirements by VLA closely match or are sometimes better than those of the existing channel assignment algorithms. Furthermore, it is found that execution of VLA is approximately two times faster than the local search algorithm-the existing channel assignment algorithm with the least bandwidth requirements. The combined advantages of minimum required bandwidth, stability of solution, and fast execution time make the VLA a useful candidate for cellular radio network planning     

Multi-hour, multi-traffic class network design for virtualpath-based dynamically reconfigurable wide-area ATM networks

The virtual path (VP) concept has been gaining attention in terms of effective deployment of asynchronous transfer mode (ATM) networks in recent years. In a recent paper, we outlined a framework and models for network design and management of dynamically reconfigurable ATM networks based on the virtual path concept from a network planning and management perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day. In this paper, we discuss in detail, a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in such dynamically reconfigurable networks. This is done based on the observation that statistical multiplexing of virtual circuits for a traffic class in a virtual path, and the deterministic multiplexing of different virtual paths leads to decoupling of the network dimensioning problem into the bandwidth estimation problem and the combined virtual path routing and capacity design problem. We discuss how bandwidth estimation can be done, then how the design problem can be solved by a decomposition algorithm by looking at the dual problem and using subgradient optimization. We provide computational results for realistic network traffic data to show the effectiveness of our approach. We show for the test problems considered, our approach does between 6% to 20% better than a local shortest-path heuristic. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% and 14% in network design costs compared to a static network based on maximum busy hour traffic     

Performance Analysis of UWB Channels for Wireless Personal Area Networks

Ultra-wide band (UWB) communication is one of the most promising technology for high data rate networks over short-range communication. The ultra-wide bandwidth offers pulses with very short duration that provides frequency diversity and multipath resolution. Ultra-wide band (UWB) channels raise new effects in the receiver, the amplitude fading statistics being different compared to the conventional narrow band wireless channels. This review paper focuses on modeling of ultra-wide band channels, especially for simulation of personal area networks and also discusses the benefits, application potential and technical challenges in wideband communication. The concept of Orthogonal Frequency Division Multiplexing (OFDM) has recently been applied in wireless communication systems due to its high data rate transmission capability with high bandwidth efficiency and its robustness to multi-path delay. UWB OFDM communication was proposed for physical layer in the IEEE 802.15.3a standard which covers wideband communication in wireless personal area networks. Since the channel model for multicarrier UWB communication is different from that of plain ultra-wide band channel, a novel modification method in UWB channel model is proposed with specific center frequency and multipath resolution. Moreover, dynamic channel estimation is necessary before demodulation of UWB OFDM signals since the radio channel is time varying and frequency selective for wideband systems. The performance of the proposed method is statistically analyzed using LS and MMSE based channel estimation methods.     

可变带宽光网络：提出、优势和关键技术

新型互联网业务迅速发展。使网络流量急剧增长,推动了对光通信容量的需求。同时,新型的互联网应用对带宽的需求具有不可预测性。这两方面因素驱动光网络朝着灵活、动态、高效的方向发展。可变带宽光网络可以在收发端根据传输距离、链路质量、业务需求动态调整传输速率、调制格式以匹配网络实际需求,提高了网络灵活性和网络生存性。可变带宽光网络关键技术包括可变带宽可重构光分插复用器、可变带宽收发机技术、可变带宽的电层技术和可变带宽管控层技术。     

A novel QoS routing protocol for LEO and MEO satellite networks

The rapid advance of communication and satellite technology pushes broadband satellite networks to carry on multimedia traffic. However, the function of onboard routing cannot be provided in existing satellite networks with inter‐satellite links, and quality of service (QoS) of satellite networks cannot be reliably guaranteed because of great difficulties in processing of long distance‐dependent traffic. In this paper, a two‐layered low‐Earth orbit and medium‐Earth orbit satellite network (LMSN) is presented. A novel hierarchical and distributed QoS routing protocol (HDRP) is investigated, and an adaptive bandwidth‐constrained minimum‐delay path algorithm is developed to calculate routing tables efficiently using the QoS metric information composed of delays and bandwidth. The performance of LMSN and HDRP is also evaluated through simulations and theoretical analysis. Copyright © 2007 John Wiley & Sons, Ltd.     

量子保密通信网络骨干链路流量规划

量子保密通信网络是一种新兴的安全网络。如何通过合理的流量规划方法提升量子保密通信网络骨干链路的带宽利用率、提升网络性价比是一个新问题。分析了量子保密通信网络流量规划的特殊性,给出了一种流量规划模型,可以实现下列 3 个方面的目标：在确定网络骨干链路密钥分发带宽的情况下,可以实现用户广域加密通信带宽的规划;借助路由规划可以提升用户广域加密通信带宽和量子链路密钥分发带宽的利用率;可以实现对网络瓶颈量子链路密钥分发带宽的合理调整。最后,通过数值模拟示例演示了本文所提出的流量规划方法的应用。     

Simulative analysis of optimal resource allocation and routing inIBCN's

The problem of resource allocation for future integrated broadband communication networks (IBCNs) is addressed. It mainly involves resource allocation at the connection level. The resource allocation problem is decomposed into the following interdependent tasks: given that a network can accommodate the bandwidth demand of a call request, determine a route for the corresponding asynchronous transfer mode (ATM) virtual connection; and allocate bandwidth, i.e. links inside the trunks of the chosen route, to this connection according to predefined limits on bandwidth use by various service calls. Various link allocation schemes combined with routing algorithms are examined. Their performance in terms of service call blocking is evaluated using a software package developed, for that purpose. It is shown that the traditional complete sharing (CS) and complete partitioning (CP) policies are not adequate for IBCNs. Movable boundary (MB) policies are more flexible and present near-optimal performance when access of broadband service to narrowband service resources is allowed and suitable routing algorithms are dynamically applied     

Research on optimal intelligent routing algorithm for IoV with machine learning and smart contract

The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data transmission. To improve the limited communication distance and poor communication quality of the Internet of Vehicles (IoV), an optimal intelligent routing algorithm is proposed in this paper. Combined multi-weight decision algorithm with the greedy perimeter stateless routing protocol, designed and evaluated standardized function for link stability. Linear additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the IoV. The blockchain system is used as the storage structure for relay data, and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet transmission. The proposed scheme is simulated and analyzed under different scenarios and different parameters. The experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.     

Radio resource management games in wireless networks: an approach to bandwidth allocation and admission control for polling service in IEEE 802.16 [Radio Resource Management and Protocol Engineering for IEEE 802.16]

Game theory is a mathematical tool developed to understand competitive situations in which rational decision makers interact to achieve their objectives. Game theory techniques have recently been applied to various engineering design problems in which the action of one component impacts (and perhaps conflicts with) that of any other component. In particular, game theory techniques have been successfully used for protocol design and optimization (e.g., radio resource management, power control) in wireless networks. In this article we present an overview of different game theory formulations. Then a survey on the game-theory-based resource management and admission control schemes in different wireless networks is presented, and several open research issues are outlined. To this end, we propose an adaptive bandwidth allocation and admission control scheme for polling service in an IEEE 802.16-based wireless metropolitan area network. A noncooperative game is formulated, and the solution of this game is determined by the Nash equilibrium for the amount of bandwidth offered to a new connection. The admission control policy ensures QoS for all connections in the system     

100 channel optical FDM technology and its applications to opticalFDM channel-based networks

Optical frequency division multiplexing (optical FDM) technology, which allows the use of an extremely broad lightwave bandwidth (10-200 THz and over) and can realize transport systems that could replace the current digital (time division multiplexing based) transport networks, is described. The future outlook for communication networks based on optical FDM technology is assessed. Based on the technical results obtained from a 100-channel optical FDM experiment, of an optical FDM channel concept is proposed and a viable architecture for optical FDM-channel-based networks is developed     

A-MAC: Adaptive Medium Access Control for Next Generation Wireless Terminals

Next generation (NG) wireless networks are envisioned to provide high bandwidth to mobile users via bandwidth aggregation over heterogeneous wireless architectures. NG wireless networks, however, impose challenges due to their architectural heterogeneity in terms of different access schemes, resource allocation techniques as well as diverse quality of service requirements. These heterogeneities must be captured and handled dynamically as mobile terminals roam between different wireless architectures. However, to address these challenges, the existing proposals require either a significant modification in the network structure and in base stations or a completely new architecture, which lead to integration problems in terms of implementation costs, scalability and backward compatibility. Thus, the integration of the existing medium access schemes, e.g., CSMA, TDMA and CDMA, dictates an adaptive and seamless medium access control (MAC) layer that can achieve high network utilization and meet diverse quality of service (QoS) requirements. In this paper, an adaptive medium access control (A-MAC) layer is proposed to address the heterogeneities posed by the NG wireless networks. A-MAC introduces a two-layered MAC framework that accomplishes the adaptivity to both architectural heterogeneities and diverse QoS requirements. A novel virtual cube concept is introduced as a unified metric to model heterogeneous access schemes and capture their behavior. Based on the virtual cube concept, A-MAC provides architecture-independent decision and QoS based scheduling algorithms for efficient multi-network access. A-MAC performs seamless medium access to multiple networks without requiring any additional modifications in the existing network structures. It is shown via extensive simulations that A-MAC provides adaptivity to the heterogeneities in NG wireless networks and achieves high performance.     

An overview of decision networks and organizations

The paper summarizes recent results on both binary and M-ary distributed hypothesis testing problems with decision makers (DMs) organized in structured decision networks. The general problem of finding an optimal organizational structure and decision strategy for such networks is formulated as a functional optimization problem. A normative model to study the effect of interactions between task structure and organizational design on the performance of hierarchical organizations is presented. A binary signal detection model is considered to illustrate the joint impact of organizational design and of task environment on the organizational decision performance. The concept of a congruent organizational structure (i.e., a structure that achieves centralized performance with minimal communication) is introduced, and a graph decomposition algorithm to synthesize congruent structures is discussed     

基于位置加权的电力通信网站点带宽估算方法

提出一种电力通信网站点通信带宽估算方法,涉及电力通信网领域?所述方法包括如下几个步骤：首先根据电力通信网拓扑图,确定电力通信网站点在电力通信网中的局部重要度和全局重要度;接着对电力通信网站点的局部重要度和全局重要度进行融合,得到电力通信网站点的实际重要度值;然后根据所述实际重要度值确定每一个站点通信带宽估算模型中的数据业务冗余系数;最后根据站点通信带宽估算模型计算电力通信网站点的规划带宽?提出的方法利用站点在网络拓扑中的位置计算站点的重要度,并将节点重要度引入站点通信带宽估算中,克服了传统站点通信带宽估算结果不够精确的问题?     

Content-based FGS coding mode determination for video streaming over wireless networks

Video streaming is the major subject of Amendment for MPEG-4 and it is developed in response to the growing needs on a video-coding standard for the video communication. The fine-granular scalability (FGS) combined with the temporal scalability addresses a variety of challenging problems in delivering video. The FGS video encoder makes the coding mode decision based on the video content and the current available bandwidth in order to achieve higher perceptual video quality. In this paper, we develop a mode selection method to find the most suitable scalable coding mode from six coding schemes: FGS, FGST, FGS-SE, and FGST with background composition based on the contents of the video sequences.     

Dynamic guard channel allocation scheme for calls in WONs

Future wireless networks will provide ubiquitous communication services to a large number of mobile users. The design of such networks is based on heterogeneous wireless overlay networks that allow efficient use of the limited available spectrum, and also cover different ranges of coverage areas. A dynamic guard channel allocation scheme for calls in wireless overlay networks is developed. The new scheme considers the mobility, current location of mobile terminals, and bandwidth status in allocating bandwidth for new calls in order to guarantee the quality of service for all calls     

Capacity and performance analysis of signaling networks inmultivendor environments

The load of common channel signaling networks is being increased through the introduction of new services such as supplementary services or mobile communication services. This may lead to a performance degradation of the signaling network, which affects both the quality of the new services and of the services already offered by the network. In the paper, a generic modeling methodology for the signaling load and the signaling network performance as a result of the various communication services is extended in order to include certain implementation-dependent particularities. The models are obtained by considering the protocol functions of Signaling System No. 7 as specified by the CCITT, as well as the information flows through these functions. With this approach, virtual processor models are derived which can be mapped onto particular implementations. This allows the analysis of signaling networks in a multivendor environment. Using these principles, a signaling network planning tool concept has been developed which provides the distinct loading of hardware and software signaling network resources, and on which hierarchical performance analysis and planning procedures are based. This allows to support the planning of signaling networks according to given service, load, and grade-of-service figures. A simple case study outlines the application of the tool concept to a network supporting Freephone, Credit Card, and ISDN voice services     

A Survey on Dynamic Spectrum Access for LTE-Advanced

Increasing utilization of LTE-Advanced (LTE-A) to meet the rapid growth in wireless bandwidth demand is an important focus for current research. Dynamic spectrum access (DSA) is a promising approach that can be utilized to improve bandwidth utilization in LTE-A systems and networks. The application of DSA is not limited to commercial use but can also be applied to provide access to other systems including public safety communication systems and device to device communications. This paper provides a general overview of DSA and a review of the recent research into the use of DSA to improve bandwidth utilization in LTE-A networks. DSA is a flexible technique that is being applied to different network technologies including cognitive radio, mobile cellular femtocells and wireless relay.

     

The evolution of packet switching

Over the past decade data communications has been revolutionized by a radically new technology called packet switching. In 1968 virtually all interactive data communication networks were circuit switched, the same as the telephone network. Circuit switching networks preallocate transmission bandwidth for an entire call or session. However, since interactive data traffic occurs in short bursts 90 percent or more of this bandwidth is wasted. Thus, as digital electronics became inexpensive enough, it became dramatically more cost-effective to completely redesign communications networks, introducing the concept of packet switching where the transmission bandwidth is dynamically allocated, permitting many users to share the same transmission line previously required for one user. Packet switching has been so successful, not only in improving the economics of data communications but in enhancing reliability and functional flexibility as well, that in 1978 virtually all new data networks being built throughout the world are based on packet switching. An open question at this time is how long will it take for voice communications to be revolutionized as well by packet switching technology. In order to better understand both the past and future evolution of this fast moving technology, this paper examines in detail the history and trends of packet switching.