Logically rearrangeable multihop lightwave networks

The optimization problem of rearrangeable multihop lightwave networks is considered. The authors formulate the flow and wavelength assignment problem, when minimizing the maximum flow in the network, as a mixed integer optimization problem subject to linear constraints. The problem is decomposed into two independent subproblems, the wavelength assignment (or connectivity problem) and the flow assignment (or routing problem). A simple heuristic provides a meaningful formulation to the connectivity problem, in a form similar to a transportation problem. An algorithm is then proposed which finds a heuristic initial logical connectivity diagram and the corresponding routing, and then iterates from that solution by applying branch-exchange operations to the connectivity diagram. The algorithm was tested on illustrative traffic matrices for an 8 node network with two transmitters and two receivers per node, and an improvement in achievable throughput over the Perfect Shuffle interconnection pattern was shown in all cases     

Distributed resource management and connection control for a multi-access interface to a broadband ISDN (BISDN)

A customer premises network (CPN) provides a common communications fabric to efficiently integrate the traffic of multiple terminals on a common access interface to a BISDN. An important consideration in choosing a CPN architecture is to facilitate terminal portability and application transparency, so as to accommodate standard broadband terminals and applications, requiring only minor modification to adapt them from the standard BISDN interface to the multi-terminal environment. This paper explores the multi-faceted issues of CPN transparency with an emphasis on the evolving BISDN control and management architecture. We introduce a control architecture that conforms to a rigorous separation between ‘call control’ and ‘connection management’. This allows the CPN to be transparent to the user to network signalling exchange, and to participate only in the connection management via a remote resource management protocol. More generally, this scheme allows a call control entity located in a local exchange node (LEN) to manage a distributed set of resources such as switches and multiplexors (and CPNs). This is achieved through the definition of a standard interoperable interface between the central call control entity and the connection control entities which may be remotely located in various network elements. The features and functionality for such an interface, which we term the bearer connection control interface, are described within the framework of the OSI remote management architecture. A standard remote resource management protocol allows for the co-operative sharing of resources across administrative domains. Although the importance of such a scheme is particularly visible as applied to remote CPN management, it is useful in other application domains where it is advantageous to distribute management processes.     

A Study of Path Protection in Large-Scale Optical Networks

We consider the problem of designing a network of optical cross-connects (OXCs) which provides end-to-end lightpath services to large numbers of client nodes, under the requirement that the network will survive any single-link failure. Our main objective is to quantify the additional resource requirements of implementing path protection schemes over a network with no survivability properties. To this end, we present heuristic routing and wavelength assignment algorithms for dedicated path protection and two variants of shared path protection, and integrate them into the physical and logical topology design framework we developed in an earlier study. We apply our heuristics to networks with up to 1000 client nodes, with a number of lightpaths that is an order of magnitude greater than the number of clients, and for a wide range of values for system parameters such as the number of wavelengths per fiber, the number of optical transceivers per client node, and the number of ports per OXC. Our results provide insight into the relative resource requirements of dedicated and shared path protection schemes. We also find that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.     

Peer-to-peer network management in an IBM SNA network

Management of IBM's Systems Network Architecture (SNA) peer-to-peer communication, called low-entry networking (LEN), is discussed. Prior to LEN, all host communications were hierarchical. LEN allows nodes like personal computers, AS400, and host applications to communicate with each other through the subarea network as peers. LEN nodes allow cooperative processing, initiate parallel and multiple sessions simultaneously, require less predefinition, and use a common LU6.2 interface. The management problems posed by decentralized processing, changes to management definitions, and dynamic session initiation are addressed. Research conducted in the The Travelers' network to determine impacts in the areas of installation, session management, problem determination, accounting and performance is reported     

Link-lifetime-based service restoration in optical datacenter network

Aiming at the correlated and cascading failures caused by large-scale disasters,a post-disaster service restoration scheme was proposed.This scheme utilized global service bandwidth concession and the limited lifetime of local links to mitigate resource crunch in the post-disaster network.According to their bandwidth and holding time requirements,the impacted services for restoration was prioritized firstly,then jointly employed anycast and manycast routing strategies to improve the service connectivity and bandwidth resource utilization.Simulation results show that the proposed scheme can significantly reduce the service loss ratio,effectively prolong the holding time of the impacted services and decrease the data flow loss ratio in the post-disaster network.     

Physical and logical validation of a network based on all-opticalpacket switching systems

The large growth of telecommunication traffic demand generated by multiple new applications and expected to last at least for the next decade will force telecom operators to consider offering more flexible transport services. All-optical packet switching is a powerful technique to provide this flexibility and to support in a cost-efficient way a wide range of bandwidth consuming applications. After a very brief introduction about the packet-switched network architecture studied in the framework of the ACTS KEOPS project, we describe the structure of the packet-switching node we have defined. We then move into physical and logical analysis of the network including more than 40 network sections based on 160 Gb/s throughput optical packet switching nodes could operate error free. In addition, logical simulations have proved that such networks could provide a quality of service (packet loss rate and packet transfer delay per node) compatible with a large variety of service classes. Both results validate the feasibility of the network concept and pace the way toward a flexible network based on all-optical switching techniques     

SNA Function Management

The path control network of Systems Network Architecture (SNA) supports communication between pairs of network addressable units called logical units, usually referred to as LU's. When communicating, information flows between LU's over a logical connection called a session. SNA defines three categories of messages which flow on LU-to-LU sessions-- session control, data flow control, and function management data. Thispaper discusses the structui'e and semantics of messages and protocols used by one LU to manage functions performed by a remote LU. The relatio.nship between distribution of function, the nature of the information, the technology, and the architecture of the data stream will be discussed. The data Streams used by SNA printers and 3270 displays will be used as examples. The paper concludes with a discussion of the possible impact of advancing electronic technology on data stream architecture.     

Network virtualization as an integrated solution for emergency communication

In this paper the Virtual Private Ad Hoc Networking (VPAN) platform is introduced as an integrated networking solution for many applications that require secure transparent continuous connectivity using heterogeneous devices and network technologies. This is done by creating a virtual logical self-organizing network on top of existing network technologies reducing complexity and maintaining session continuity right from the start. One of the most interesting applications relies in the field of emergency communication with its specific needs which will be discussed in this paper and matched in detail against the architecture and features of the VPAN platform. The concept and dynamics are demonstrated and evaluated with measurements done on real hardware.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Branch-exchange sequences for reconfiguration of lightwave networks

Some of today's telecommunications networks have the ability to superimpose some form of logical connectivity, or virtual topology, on top of the underlying physical infrastructure. According to the degree of independence between the logical connectivity and the physical topology, the network can dynamically adapt its virtual topology to track changing traffic conditions, and cope with failure of network equipment. This is particularly true for lightwave networks, where a logical connection diagram is achieved by assignment of transmitting and receiving wavelengths to the network stations that tap into, and communicate over, an infrastructure of fiber glass. Use of tunable transmitters and/or receivers allow the logical connectivity to be optimized to prevailing traffic conditions. With rearrangeability having thus emerged as a powerful network attribute, this paper discusses the reconfiguration phase which is the transition between the current logical connection diagram and a target diagram. We consider here an approach where the network reaches some target connectivity graph through a sequence of intermediate connection diagrams, so that two successive diagrams differ by a single branch-exchange operation. This is an attempt at logically reconfiguring the network in a way that is minimally disruptive to the traffic. We propose and compare three polynomial-time algorithms that search for “short” sequences of branch-exchange operations, so as to minimize the overall reconfiguration time. For networks made of up to 40 stations, theoretical and simulation results show that, when a randomly selected diagram is to be changed to another randomly chosen diagram, the average number of branch-exchange operations required grows linearly with the size of the network     

Fast RSVP: Efficient RSVP Mobility Support for Mobile IPv6

In recent years, with the development of mobile communication technologies and the increase of available wireless transmission bandwidth, deploying multimedia services in next generation mobile IPv6 networks has become an inevitable trend. RSVP (resource reservation protocol) proposed by the IETF is designed for hardwired and fixed networks and can not be used in mobile environments. This paper proposes a protocol, called Fast RSVP, to reserve resources for mobile IPv6. The protocol adopts a cross-layer design approach where two modules (RSVP module and Mobile IPv6 module) at different layers cooperate with each other. Fast RSVP divides a handover process with QoS guarantees into two stages: (1) setup of the resource reservation neighbor tunnel and (2) resource reservation on the optimized route. It can help a mobile node realize fast handover with QoS guarantees as well as avoid resource wasting by triangular routes, advanced reservations and duplicate reservations. In addition, fast RSVP reserves “guard channels” for handover sessions, thus greatly reducing the handover session forced termination rate while maintaining high performance of the network. Based on extensive performance analysis and simulations, Fast RSVP, compared with existing methods of resource reservation in mobile environments, performs better in terms of packet delay and throughput during handover, QoS recovery time after handover, resource reservation cost, handover session forced termination rate and overall session completion rate.     

Plate-forme pour le déploiement coopératif sensible au contexte

Application deployment in sessions composed of several users is now a hot topic. These users communicate together with heterogeneous terminals. Deployed applications on these nodes must fit to the execution environment and must be interoperable with applications already installed on the others nodes of the session. In this paper, we propose an architecture, which provides a user with missing applications according to the session requirements while respecting compatibility and interoperability constraints. This decentralized and distributed architecture is based on a context-aware deployment algorithm running on each node. After discovering applications scattered on a peer-to-peer network, the algorithm generates deployment configurations needed for any deployment node. Then, the algorithm performs the necessary downloads and instantiations. We present our context-aware deployment platform composed of generic modules. These modules includeApis to build deployment services according to this architecture.     

Sip-empowered optical networks for future it services and applications - [Topics in optical communications]

This article presents a novel applicationaware network architecture for evolving and emerging IT services and applications. It proposes to enrich an optical burst switching network with a session control layer that can close the gap between application requests and network control. The session control layer is implemented using the Session Initiation Protocol, giving birth to what is called a SIP-OBS architecture. The article discusses the important added value of this architecture, and shows that it may support a number of end-to-end resource discovery and reservation strategies (for both network and non-network resources). Finally, it presents a testbed implementation where this approach was experimentally validated.     

全光包交换系统的实现原理

描述了光包交换节点的结构,分析了网络的物理和逻辑的可行性,介绍了一个由40个网络节点组成的节点流量达160Gbit/s的物理网络,网络能提供较好的服务质量（包丢失率和包传输延迟）并兼容多种业务,这一结果为基于全光包交换技术的灵活性网络的研究铺平了道路。     

MCMP: a transport/session level distributed protocol for desktopconference setup

The multiparty conference management protocol (MCMP) is an end-to-end distributed session/transport level protocol intended for group management of desktop conferencing applications. This paper describes the MCMP conference setup algorithms and proves that they meet specified correctness properties. MCMP sets up control channels for use in exchanging control information while the conference is in progress. The logical topology used is a completely interconnected mesh, MCMP always provides best effort services in cases of failures. Correctness properties guaranteed upon termination of the protocol include connectivity, validity, uniqueness, and consistency of local views. Application control information that can be exchanged using the control channels include resource negotiation and subconferencing     

Flow control schemes and delay/loss tradeoff in ATM networks

Performance and flow control mechanisms, which represent ATM (asynchronous transfer mode) flexibility, are discussed. To control performance, delay- and/or loss-sensitive service classes, and two mechanisms to realize these classes, are proposed. It is shown that it is possible to have better performance than with other mechanisms, such as no-class distinction or simple priority methods. It is further suggested that this performance controllability results in the provision of multiple logical services, including quasi-STM (synchronous transfer mode; compatible with circuit switching), by an ATM network. ATM flow control is based on a call-oriented resource allocation mechanism similar to circuit switching. The concepts of call/line bit rate ratio and multiplexing degree are seen to be significant for efficient use of resources. When the network handles calls with large call/line bit rate ratios, user-specified flow control parameters at the call setup phase are important for resource assignment. The definition of two types of maximum throughput of each call and its usage for resource management are proposed     

支持网络编码的认知无线自组网拓扑控制算法

对认知无线自组网中有限的带宽进行研究,提出支持网络编码的拓扑控制算法。算法分为3个阶段：初始拓扑构建阶段,利用最短路径算法为单播业务构建拓扑,利用基于网络编码的最短路径算法为多播业务构建K冗余拓扑;拓扑优化阶段,通过逐条删除满足一定条件的链路优化拓扑;拓扑恢复阶段,针对关键点失效,利用与失效链路不在同一路径簇且开销最小的链路恢复网络连通。仿真结果表明,算法能够提高无线资源复用率,增强网络抗毁性。     

Exploiting Selfishness,Altruism and Common Welfare to Enhance Performance of Routing Protocols for Mobile Ad hoc Networks

Mobile Ad hoc Networks are sensitive to selfish behavior that may occur due to restricted power or other resources. Several approaches have been investigated so far to address this problem. In many of them, upon detection, a selfish node is punished with isolation from network services access and in most cases with no possibility for redemption. In this paper, we show that selfish behavior can be exploited to improve network performance. We modify an existing routing protocol by introducing an altruism coefficient to model the overall satisfaction of every node from the network services. When the altruism coefficient is increased, the selfish behavior is decreased. We extend our approach by introducing a common welfare factor, which actually enforces the nodes to cooperate when the network connectivity is critical. A network simulator is utilized to show the impact of our schemes on the performance of the routing protocol when selfish nodes are present in the network.

     

Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm

In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge here is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in the case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm works in an iterative manner: after each iteration it learns more about the structure of the logical graph and in the next iteration it uses this information to improve its solution. The algorithm can take link capacity constraints into account and can be extended to deal with multiple simultaneous link failures and node failures. In a large series of tests we compare FastSurv with current state-of-the-art algorithms for this problem. We show that it can provide better solutions in much shorter time, and that it is more scalable with respect to the number of nodes, both in terms of solution quality and run time.     

Secure multi‐factor remote user authentication scheme for Internet of Things environments

Because of the exponential growth of Internet of Things (IoT), several services are being developed. These services can be accessed through smart gadgets by the user at any place, every time and anywhere. This makes security and privacy central to IoT environments. In this paper, we propose a lightweight, robust, and multi‐factor remote user authentication and key agreement scheme for IoT environments. Using this protocol, any authorized user can access and gather real‐time sensor data from the IoT nodes. Before gaining access to any IoT node, the user must first get authenticated by the gateway node as well as the IoT node. The proposed protocol is based on XOR and hash operations, and includes: (i) a 3‐factor authentication (ie, password, biometrics, and smart device); (ii) mutual authentication ; (iii) shared session key ; and (iv) key freshness . It satisfies desirable security attributes and maintains acceptable efficiency in terms of the computational overheads for resource constrained IoT environment. Further, the informal and formal security analysis using AVISPA proves security strength of the protocol and its robustness against all possible security threats. Simulation results also prove that the scheme is secure against attacks.