10,681 research outputs found
Case Study - IPv6 based building automation solution integration into an IPv4 Network Service Provider infrastructure
The case study presents a case study describing an Internet Protocol (IP) version 6 (v6) introduction to an IPv4 Internet Service Provider (ISP) network infrastructure. The case study driver is an ISP willing to introduce a new “killer” service related to Internet of Things (IoT) style building automation. The provider and cooperation of third party companies specialized in building automation will provide the service. The ISP has to deliver the network access layer and to accommodate the building automation solution traffic throughout its network infrastructure. The third party companies are system integrators and building automation solution vendors. IPv6 is suitable for such solutions due to the following reasons. The operator can’t accommodate large number of IPv4 embedded devices in its current network due to the lack of address space and the fact that many of those will need clear 2 way IP communication channel.
The Authors propose a strategy for IPv6 introduction into operator infrastructure based on the current network architecture present service portfolio and several transition mechanisms. The strategy has been applied in laboratory with setup close enough to the current operator’s network. The criterion for a successful experiment is full two-way IPv6 application layer connectivity between the IPv6 server and the IPv6 Internet of Things (IoT) cloud
One More Weight is Enough: Toward the Optimal Traffic Engineering with OSPF
Traffic Engineering (TE) leverages information of network traffic to generate
a routing scheme optimizing the traffic distribution so as to advance network
performance. However, optimize the link weights for OSPF to the offered traffic
is an known NP-hard problem. In this paper, motivated by the fairness concept
of congestion control, we firstly propose a new generic objective function,
where various interests of providers can be extracted with different parameter
settings. And then, we model the optimal TE as the utility maximization of
multi-commodity flows with the generic objective function and theoretically
show that any given set of optimal routes corresponding to a particular
objective function can be converted to shortest paths with respect to a set of
positive link weights. This can be directly configured on OSPF-based protocols.
On these bases, we employ the Network Entropy Maximization(NEM) framework and
develop a new OSPF-based routing protocol, SPEF, to realize a flexible way to
split traffic over shortest paths in a distributed fashion. Actually, comparing
to OSPF, SPEF only needs one more weight for each link and provably achieves
optimal TE. Numerical experiments have been done to compare SPEF with the
current version of OSPF, showing the effectiveness of SPEF in terms of link
utilization and network load distribution
Multihop Routing in Ad Hoc Networks
This paper presents a dual method of closed-form analysis and lightweight
simulation that enables an evaluation of the performance of mobile ad hoc
networks that is more realistic, efficient, and accurate than those found in
existing publications. Some features accommodated by the new analysis are
shadowing, exclusion and guard zones, and distance-dependent fading. Three
routing protocols are examined: least-delay, nearest-neighbor, and
maximum-progress routing. The tradeoffs among the path reliabilities, average
conditional delays, average conditional number of hops, and area spectral
efficiencies are examined.Comment: 6 pages, 6 figures, to appear in IEEE Military Commun. Conf.
(MILCOM), 201
RECOMAC: a cross-layer cooperative network protocol for wireless ad hoc networks
A novel decentralized cross-layer multi-hop cooperative protocol, namely, Routing Enabled Cooperative Medium Access Control (RECOMAC) is proposed for wireless ad hoc networks. The protocol architecture makes use of cooperative
forwarding methods, in which coded packets are forwarded via opportunistically formed cooperative sets within a region, as RECOMAC spans the physical, medium access control (MAC) and routing layers. Randomized coding is exploited at the physical layer to realize cooperative transmissions, and cooperative forwarding is implemented for routing functionality, which is submerged into the MAC layer, while the overhead for MAC and route set up is minimized. RECOMAC is shown to provide dramatic performance improvements of eight times higher throughput and one tenth of end-to-end delay than that of the conventional architecture in practical wireless mesh networks
Distributed Optimization of Multi-Beam Directional Communication Networks
We formulate an optimization problem for maximizing the data rate of a common
message transmitted from nodes within an airborne network broadcast to a
central station receiver while maintaining a set of intra-network rate demands.
Assuming that the network has full-duplex links with multi-beam directional
capability, we obtain a convex multi-commodity flow problem and use a
distributed augmented Lagrangian algorithm to solve for the optimal flows
associated with each beam in the network. For each augmented Lagrangian
iteration, we propose a scaled gradient projection method to minimize the local
Lagrangian function that incorporates the local topology of each node in the
network. Simulation results show fast convergence of the algorithm in
comparison to simple distributed primal dual methods and highlight performance
gains over standard minimum distance-based routing.Comment: 6 pages, submitte
Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc
wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximization problem with these constraints.
By dual decomposition, the resource allocation problem
naturally decomposes into three subproblems: congestion control,
routing and scheduling that interact through congestion price.
The global convergence property of this algorithm is proved. We
next extend the dual algorithm to handle networks with timevarying
channels and adaptive multi-rate devices. The stability
of the resulting system is established, and its performance is
characterized with respect to an ideal reference system which
has the best feasible rate region at link layer.
We then generalize the aforementioned results to a general
model of queueing network served by a set of interdependent
parallel servers with time-varying service capabilities, which
models many design problems in communication networks. We
show that for a general convex optimization problem where a
subset of variables lie in a polytope and the rest in a convex set,
the dual-based algorithm remains stable and optimal when the
constraint set is modulated by an irreducible finite-state Markov
chain. This paper thus presents a step toward a systematic way
to carry out cross-layer design in the framework of “layering as
optimization decomposition” for time-varying channel models
- …