scholarly journals Energy-delay considerations in coded packet flows

2011 ◽  
Author(s):  
Daniel E. Lucani ◽  
Jorg Kliewer
Keyword(s):  
Packet Flows

scholarly journals Scalable software architecture for distributed MMORPG traffic generation based on integration of UrBBaN-Gen and IMUNES

2012 ◽  
Vol 8 (4) ◽  
pp. 93
Author(s):  
Valter Vasić ◽  
Mirko Sužnjević ◽  
Miljenko Mikuc ◽  
Maja Matijašević
Keyword(s):  
Software Architecture ◽  
Control Function ◽  
Role Playing ◽  
Network Simulator ◽  
Generation Process ◽  
Main Challenge ◽  
Traffic Generation ◽  
Role Playing Game ◽  
Packet Flows ◽  
Scalable Software

We present a scalable software architecture for distributed traffic generation capable of producing Massively Multiplayer Online Role-Playing Game (MMORPG) packet flows in a statistically accurate manner for thousands of concurrent players. The main challenge, to achieve truly massive scale traffic generation, has been achieved by introducing kernel based virtualization, pioneered by the network simulator/emulator IMUNES, into the User Behaviour Based Network Traffic Generation (UrBBan-Gen, introduced in our earlier work). The UrBBan-Gen software architecture consists of four modules: Service repository, Control function and user interface, Behaviour process, and Traffic generation process. IMUNES has been integratedinto the virtualization part of the Traffic generation process,which has resulted in two improvements: 1) increasing thenumber of generated packet flows while accurately replicating the required statistical properties, and, 2) introducing the ability to run various network scenarios in simulated, as well as real networks, under realistic traffic loads. With respect to the traffic generation capabilities of the previous version of UrBBan-Gen, which was based on Linux containers, the IMUNES based solution demonstrates higher scalability, lower packet loss rates, and lower CPU load for both the UDP traffic at high packet rate and “thin” TCP traffic flows typical for MMORPGs.

Constrained max-min fair scheduling of variable-length packet-flows to multiple servers

2017 ◽  
Vol 73 (3-4) ◽  
pp. 219-237 ◽  
Author(s):  
J. Khamse-Ashari ◽  
G. Kesidis ◽  
I. Lambadaris ◽  
B. Urgaonkar ◽  
Y. Zhao
Keyword(s):  
Variable Length ◽  
Fair Scheduling ◽  
Multiple Servers ◽  
Packet Flows

Oscillations in self-aware networks

2008 ◽  
Vol 464 (2096) ◽  
pp. 2169-2185 ◽  
Author(s):  
Michael Gellman
Keyword(s):  
Adaptive Routing ◽  
Test Bed ◽  
Time Dynamic ◽  
Multiple Flows ◽  
Pros And Cons ◽  
Improved Performance ◽  
Store And Forward ◽  
Packet Flows ◽  
Distributed Reinforcement

Adaptive routing is once again of interest owing to the possibility to couple online probing in networks with real-time dynamic and distributed control of paths and flows. Wireless networks, with their rapidly changing network conditions also create a need to revisit this issue. This paper uses measurements in a wired adaptive network test bed, the cognitive packet network (CPN), to investigate the pros and cons of adaptive routing. CPN routes packet flows through a store and forward network according to their quality of service (QoS) needs through an online distributed reinforcement learning mechanism. This paper investigates routing oscillations that occur due to the interaction of multiple flows and studies their effect on QoS in the context of CPN. Our results indicate that routing oscillations can be easily controlled by randomizing the route switching, and that from an overall QoS viewpoint increased switching can also lead to improved performance.

Controlling the delay trade-off between packet flows using multiple reserved places

2008 ◽  
Vol 65 (6-7) ◽  
pp. 484-511 ◽  
Author(s):  
S. De Vuyst ◽  
S. Wittevrongel ◽  
D. Fiems ◽  
H. Bruneel
Keyword(s):  
Trade Off ◽  
Packet Flows
Sign in / Sign up

Export Citation Format

Share Document