Enabling wireless Software Defined Networking in cloud based Machine-to-Machine gateway

Introduction: Machine-to-machine communication assumes data transmission from various wireless devices and attracts attention of cellular operators. In this regard, it is crucial to recognize and control overload situations when a large number of such devices access the network over a short time interval.Purpose:Analysis of the radio network overload at the initial network entry stage in a machine-to-machine communication system.Results: A system is considered that features multiple smart meters, which may report alarms and autonomously collect energy consumption information. An analytical approach is proposed to study the operation of a large number of devices in such a system as well as model the settings of the random-access protocol in a cellular network and overload control mechanisms with respect to the access success probability, network access latency, and device power consumption. A comparison between the obtained analytical results and simulation data is also offered.

Download Full-text

Attacks in Software-Defined Networking: A Review

SSRN Electronic Journal ◽

10.2139/ssrn.3564048 ◽

2020 ◽

Author(s):

Anmol Mahajan ◽

Abhinav Bhandari

Keyword(s):

Software Defined Networking

Download Full-text

Prospects for Software Defined Networking and Network Function Virtualization in Media and Broadcast

SMPTE 2015 Annual Technical Conference and Exhibition ◽

10.5594/m001633 ◽

2015 ◽

Cited By ~ 3

Author(s):

John Ellerton ◽

Andrew Lord ◽

Paul Gunning ◽

Kristan Farrow ◽

Paul Wright ◽

...

Keyword(s):

Software Defined Networking ◽

Network Function Virtualization ◽

Network Function

Download Full-text

Platform Independent Analysis of Probabilities on Multithreaded Programs

International Journal of Software Innovation ◽

10.4018/ijsi.2013070104 ◽

2013 ◽

Vol 1 (3) ◽

pp. 48-65

Author(s):

Yuting Chen

Keyword(s):

Operating System ◽

Static Analysis ◽

Main Idea ◽

Experimental Results ◽

Machine To Machine ◽

Concurrent Program ◽

Acceptable Accuracy ◽

Multithreaded Programs ◽

Independent Analysis ◽

And Performance

A concurrent program is intuitively associated with probability: the executions of the program can produce nondeterministic execution program paths due to the interleavings of threads, whereas some paths can always be executed more frequently than the others. An exploration of the probabilities on the execution paths is expected to provide engineers or compilers with support in helping, either at coding phase or at compile time, to optimize some hottest paths. However, it is not easy to take a static analysis of the probabilities on a concurrent program in that the scheduling of threads of a concurrent program usually depends on the operating system and hardware (e.g., processor) on which the program is executed, which may be vary from machine to machine. In this paper the authors propose a platform independent approach, called ProbPP, to analyzing probabilities on the execution paths of the multithreaded programs. The main idea of ProbPP is to calculate the probabilities on the basis of two kinds of probabilities: Primitive Dependent Probabilities (PDPs) representing the control dependent probabilities among the program statements and Thread Execution Probabilities (TEPs) representing the probabilities of threads being scheduled to execute. The authors have also conducted two preliminary experiments to evaluate the effectiveness and performance of ProbPP, and the experimental results show that ProbPP can provide engineers with acceptable accuracy.

Download Full-text