Given a set of messages to be transmitted in packages from a set of sending stations to a set of
receiving stations, we are required to schedule the packages so as to achieve the minimum
possible time from the moment the 1st transmission initiates to the concluding of the last.
Preempting packets in order to reroute message remains, as part of some other packet to be
transmitted at a later time would be a great means to achieve our goal, if not for the fact that
each preemption will come with a reconfiguration cost that will delay our entire effort. The
problem has been extensively studied in the past and various algorithms have been proposed to
handle many variations of the problem. In this paper we propose an improved algorithm that we
call the Split-Graph Algorithm (SGA). To establish its efficiency we compare it, to two of the
algorithms developed in the past. These two are the best presented in bibliography so far, one in
terms of approximation ratio and one in terms of experimental results.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
AN OPEN SHOP APPROACH IN APPROXIMATING OPTIMAL DATA TRANSMISSION DURATION IN ...csandit
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination.However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSA’s efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results.
A comparison of efficient algorithms for scheduling parallel data redistributionIJCNCJournal
Data redistribution in parallel is an often-address
ed issue in modern computer networks. In this conte
xt, we
study the case of data redistribution over a switch
ing network. Data from the source stations need to
be
transferred to the destination stations in the mini
mum time possible. Unfortunately the time required
to
complete the transfer is burdened by each switching
and thus producing an optimal schedule is proven t
o
be computationally intractable. For the purposes of
this paper we consider two algorithms, which have
been proved to be very efficient in the past. To ge
t improved results in comparison to previous approa
ches,
we propose splitting the data in two clusters depen
ding on the size of the data to be transferred. To
prove
the efficiency of our approach we ran experiments o
n all three algorithms, comparing the time span of
the
schedules produced as well as the running times to
produce those schedules. The test cases we ran
indicate that not only our newly proposed algorithm
yields better results in terms of the schedule pro
duced
but runs faster as well.
Basic communication operations - One to all BroadcastRashiJoshi11
Brief description of Basic communication operations in parallel computing along with description of One to all Broadcast, its implementation on ring, mesh and hypercube, cost of and how to improve speed of one to all broadcast.
In all-reduce, each node starts with a buffer of size m and the final results of the operation are identical buffers of size m on each node that are formed by combining the original p buffers using an associative operator.
A CRITICAL IMPROVEMENT ON OPEN SHOP SCHEDULING ALGORITHM FOR ROUTING IN INTER...IJCNCJournal
In the past years, Interconnection Networks have been used quite often and especially in applications where parallelization is critical. Message packets transmitted through such networks can be interrupted
using buffers in order to maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology reconfiguration and consequently in
time cost. The problem of scheduling message packets through such a network is referred to as PBS and is
known to be NP-Hard. In this paper we haveimproved,
ritically, variations of polynomially solvable
instances of Open Shop to approximate PBS. We have combined these variations and called the induced
algorithmI_HSA (Improved Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency
of I_HSA and found that in all datasets used it produces schedules very close to the optimal. In addition, we
tested I_HSA with datasets that follow non-uniform distributions and provided statistical data which
illustrates better its performance.To further establish I_HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
AN OPEN SHOP APPROACH IN APPROXIMATING OPTIMAL DATA TRANSMISSION DURATION IN ...csandit
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used quite often and especially as far as broadband applications are concerned. Message packets transmitted through such networks can be interrupted using time slots in order to maximize network usage and minimize the time required for all messages to reach their destination.However, preempting a packet will result in time cost. The problem of scheduling message packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper we have reduced PBS to Open Shop Scheduling and designed variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these variations and called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency of HSA and found that in all datasets used it produces schedules very close to the optimal. To further establish HSA’s efficiency we ran tests to compare it to SGA, another algorithm which when tested in the past has yielded excellent results.
A comparison of efficient algorithms for scheduling parallel data redistributionIJCNCJournal
Data redistribution in parallel is an often-address
ed issue in modern computer networks. In this conte
xt, we
study the case of data redistribution over a switch
ing network. Data from the source stations need to
be
transferred to the destination stations in the mini
mum time possible. Unfortunately the time required
to
complete the transfer is burdened by each switching
and thus producing an optimal schedule is proven t
o
be computationally intractable. For the purposes of
this paper we consider two algorithms, which have
been proved to be very efficient in the past. To ge
t improved results in comparison to previous approa
ches,
we propose splitting the data in two clusters depen
ding on the size of the data to be transferred. To
prove
the efficiency of our approach we ran experiments o
n all three algorithms, comparing the time span of
the
schedules produced as well as the running times to
produce those schedules. The test cases we ran
indicate that not only our newly proposed algorithm
yields better results in terms of the schedule pro
duced
but runs faster as well.
Basic communication operations - One to all BroadcastRashiJoshi11
Brief description of Basic communication operations in parallel computing along with description of One to all Broadcast, its implementation on ring, mesh and hypercube, cost of and how to improve speed of one to all broadcast.
In all-reduce, each node starts with a buffer of size m and the final results of the operation are identical buffers of size m on each node that are formed by combining the original p buffers using an associative operator.
A CRITICAL IMPROVEMENT ON OPEN SHOP SCHEDULING ALGORITHM FOR ROUTING IN INTER...IJCNCJournal
In the past years, Interconnection Networks have been used quite often and especially in applications where parallelization is critical. Message packets transmitted through such networks can be interrupted
using buffers in order to maximize network usage and minimize the time required for all messages to reach
their destination. However, preempting a packet will result in topology reconfiguration and consequently in
time cost. The problem of scheduling message packets through such a network is referred to as PBS and is
known to be NP-Hard. In this paper we haveimproved,
ritically, variations of polynomially solvable
instances of Open Shop to approximate PBS. We have combined these variations and called the induced
algorithmI_HSA (Improved Hybridic Scheduling Algorithm). We ran experiments to establish the efficiency
of I_HSA and found that in all datasets used it produces schedules very close to the optimal. In addition, we
tested I_HSA with datasets that follow non-uniform distributions and provided statistical data which
illustrates better its performance.To further establish I_HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
ENHANCEMENT OF TCP FAIRNESS IN IEEE 802.11 NETWORKScscpconf
The usage of fixed buffers in 802.11 networks has a number of disadvantages associated with
it. This includes high delay, reduced throughput and inefficient channel utilisation. To
overcome this, a dynamic buffer sizing algorithm, the A* algorithm has been implemented at
the access point. In this algorithm buffer size is dynamically adjusted depending upon the
current channel conditions and hence delay is reduced and the throughput is maintained. But
in 802.11 networks with DCF collision avoidance mechanism, it creates significant amount of
unfairness between the upstream and downstream TCP flows, with clusters of upstream ACKs
blocking downstream data at the access point. Thus a variation of the Explicit Window
Adaptation (EWA) scheme has been used to regulate the queuing time of the upload clients by
calculating the feedback value at the access point. This creates fairness and increases the number of transmission opportunities for the downstream traffic
Optimization of Collective Communication in MPICH Lino Possamai
This is a lecture about the paper: "Optimization of Collective Communication in MPICH". Department of Computer Science, University Ca' Foscari of Venice, Italy
Design and Fabrication of a Two Axis Parabolic Solar Dish CollectorIJERA Editor
The work consists of the design of the chain drive system and the fabrication of the two axis parabolic solar dish.
It is a model study of the two axis parabolic dish which worked by the automatic circuit that was developed. Ready
made parabolic solar dish is taken and fabricated. The circular iron ring provides the two axis motion of the dish.
A compound chain drive system was developed for the smooth movement of the dish. An electromechanical
system which tracks the sun on both axes and which is controlled via a programmable logic control (PLC) was
designed and implemented. In this a theoretical study was done. A C program was made which gave the required
result for the graphical representation of the recorded radiation. Programmable Logic Controls (PLC) was used
instead of photo sensors, which are widely used for tracking the sun. The azimuthal angle of the sun from sunrise
to sunset times was calculated for each day of the year at 23.59 Lat & 72.38Longitude in the Northern hemisphere,
the location of the city Mehsana. According to this azimuth angle, the required analog signal was taken from the
PLC analog module and sent to the power window motor, which controlled the position of the panel to ensure that
the rays fall vertically on the panel. After the mechanical control of the system was started, the performance
measurements of the solar panel were carried out. The values obtained from the measurements were compared and
the necessary evaluations were conducted.
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The
performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed
DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated
and less complexity also involved by the simulation of the DST-DMT system.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
ENHANCEMENT OF TCP FAIRNESS IN IEEE 802.11 NETWORKScscpconf
The usage of fixed buffers in 802.11 networks has a number of disadvantages associated with
it. This includes high delay, reduced throughput and inefficient channel utilisation. To
overcome this, a dynamic buffer sizing algorithm, the A* algorithm has been implemented at
the access point. In this algorithm buffer size is dynamically adjusted depending upon the
current channel conditions and hence delay is reduced and the throughput is maintained. But
in 802.11 networks with DCF collision avoidance mechanism, it creates significant amount of
unfairness between the upstream and downstream TCP flows, with clusters of upstream ACKs
blocking downstream data at the access point. Thus a variation of the Explicit Window
Adaptation (EWA) scheme has been used to regulate the queuing time of the upload clients by
calculating the feedback value at the access point. This creates fairness and increases the number of transmission opportunities for the downstream traffic
Optimization of Collective Communication in MPICH Lino Possamai
This is a lecture about the paper: "Optimization of Collective Communication in MPICH". Department of Computer Science, University Ca' Foscari of Venice, Italy
Design and Fabrication of a Two Axis Parabolic Solar Dish CollectorIJERA Editor
The work consists of the design of the chain drive system and the fabrication of the two axis parabolic solar dish.
It is a model study of the two axis parabolic dish which worked by the automatic circuit that was developed. Ready
made parabolic solar dish is taken and fabricated. The circular iron ring provides the two axis motion of the dish.
A compound chain drive system was developed for the smooth movement of the dish. An electromechanical
system which tracks the sun on both axes and which is controlled via a programmable logic control (PLC) was
designed and implemented. In this a theoretical study was done. A C program was made which gave the required
result for the graphical representation of the recorded radiation. Programmable Logic Controls (PLC) was used
instead of photo sensors, which are widely used for tracking the sun. The azimuthal angle of the sun from sunrise
to sunset times was calculated for each day of the year at 23.59 Lat & 72.38Longitude in the Northern hemisphere,
the location of the city Mehsana. According to this azimuth angle, the required analog signal was taken from the
PLC analog module and sent to the power window motor, which controlled the position of the panel to ensure that
the rays fall vertically on the panel. After the mechanical control of the system was started, the performance
measurements of the solar panel were carried out. The values obtained from the measurements were compared and
the necessary evaluations were conducted.
Multi carrier equalization by restoration of redundanc y (merry) for adaptive...IJNSA Journal
This paper proposes a new blind adaptive channel shortening approach for multi-carrier systems. The
performance of the discrete Fourier transform-DMT (DFT-DMT) system is investigated with the proposed
DST-DMT system over the standard carrier serving area (CSA) loop1. Enhanced bit rates demonstrated
and less complexity also involved by the simulation of the DST-DMT system.
10 Insightful Quotes On Designing A Better Customer ExperienceYuan Wang
In an ever-changing landscape of one digital disruption after another, companies and organisations are looking for new ways to understand their target markets and engage them better. Increasingly they invest in user experience (UX) and customer experience design (CX) capabilities by working with a specialist UX agency or developing their own UX lab. Some UX practitioners are touting leaner and faster ways of developing customer-centric products and services, via methodologies such as guerilla research, rapid prototyping and Agile UX. Others seek innovation and fulfilment by spending more time in research, being more inclusive, and designing for social goods.
Experience is more than just an interface. It is a relationship, as well as a series of touch points between your brand and your customer. Here are our top 10 highlights and takeaways from the recent UX Australia conference to help you transform your customer experience design.
For full article, continue reading at https://yump.com.au/10-ways-supercharge-customer-experience-design/
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScscpconf
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
An Open Shop Approach in Approximating Optimal Data Transmission Duration in ...cscpconf
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being used
quite often and especially as far as broadband applications are concerned. Message packets
transmitted through such networks can be interrupted using time slots in order to maximize
network usage and minimize the time required for all messages to reach their destination.
However, preempting a packet will result in time cost. The problem of scheduling message
packets through such a network is referred to as PBS and is known to be NP-Hard. In this paper
we have reduced PBS to Open Shop Scheduling and designed variations of polynomially
solvable instances of Open Shop to approximate PBS. We have combined these variations and
called the induced algorithm HSA (Hybridic Scheduling Algorithm). We ran experiments to
establish the efficiency of HSA and found that in all datasets used it produces schedules very
close to the optimal. To further establish HSA’s efficiency we ran tests to compare it to SGA,
another algorithm which when tested in the past has yielded excellent results.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1) and GWA. IMGA has proven to produce the most efficient schedule on all counts.
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
Computationally Efficient Multi-Antenna Techniques for Multi-User Two-Way Wire...IJECEIAES
In this work, we are interested in implementing, developing and evaluating multi-antenna techniques used for multi-user two-way wireless relay networks that provide a good tradeoff between the computational complexity and performance in terms of symbol error rate and achievable data rate. In particular, a variety of newly multi-antenna techniques is proposed and studied. Some techniques based on orthogonal projection enjoy low computational complexity. However, the performance penalty associated with them is high. Other techniques based on maximum likelihood strategy enjoy high performance, however, they suffer from very high computational complexity. The Other techniques based on randomization strategy provide a good trade-off between the computational complexity and performance where they enjoy low computational complexity with almost the same performance as compared to the techniques based on maximum likelihood strategy.
Tomography is important for network design and routing optimization. Prior approaches require either
precise time synchronization or complex cooperation. Furthermore, active tomography consumes explicit
probing resulting in limited scalability. To address the first issue we propose a novel Delay Correlation
Estimation methodology named DCE with no need of synchronization and special cooperation. For the
second issue we develop a passive realization mechanism merely using regular data flow without explicit
bandwidth consumption. Extensive simulations in OMNeT++ are made to evaluate its accuracy where we
show that DCE measurement is highly identical with the true value. Also from test result we find that
mechanism of passive realization is able to achieve both regular data transmission and purpose of
tomography with excellent robustness versus different background traffic and package size.
Scheduling Using Multi Objective Genetic Algorithmiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
In this paper, low linear architectures for analyzing the first two maximum or minimum values are of paramount importance in several uses, including iterative decoders. The min-sum giving out step is to that it produces only two diverse output magnitude values irrespective of the number of incoming bit-to check communication. These new micro-architecture structures would utilize the minimum number of comparators by exploiting the concept of survivors in the search. These would result in reduced number of comparisons and consequently reduced energy use. Multipliers are complex units and play an important role in finding the overall area, speed and power consumption of digital designs. By using the multiplier we can minimize the parameters like latency, complexity and power consumption. The decoding algorithms we propose generalize and unify the decoding schemes originally presented the product codes and those of low-density parity-check codes.
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
FAULT-TOLERANT MULTIPATH ROUTING SCHEME FOR ENERGY EFFICIENT WIRELESS SENSOR ...ijwmn
Themain challengein wireless sensor network is to improve the fault tolerance of each
node and also provide an energy efficient fast data routing service. In this paper we propose an
energyefficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant
multipath routing scheme for energy efficientwireless sensor network (FTMRS).The FTMRSis based on
multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and
other two backup paths are used as alternative path for faulty network and to handle the overloaded
traffic on main channel.Shortest path data routing ensures energy efficient data routing. The
performance analysis of FTMRSshows better results compared to other popular fault tolerant techniques
in wireless sensor networks.
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Similar to ALGORITHMS FOR PACKET ROUTING IN SWITCHING NETWORKS WITH RECONFIGURATION OVERHEAD (20)
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
2. 192 Computer Science & Information Technology (CS & IT)
packets transmission will come with a time cost. Information on the data that was not sent has to
be saved and a new setup has to be initiated for the next packet to start transmitting. Consequently
prior to sending any of the packages there will be a setup overhead. We consider this overhead to
be constant for all transmission initiations. In this paper we aim to minimize the duration of the
aforementioned process.
2. PREVIOUS RESULTS
PBS is known to be NP-Complete [9] and proved to be 4/3-ε inapproximable for any ε>0, unless
P=NP in [4].
As PBS algorithms can be implemented in various applications, many polynomial time
algorithms have been designed to produce solutions close to the optimal, found in [1], [9], [12],
[8]. The best guaranteed approximation ratio so far is
1
2
d 1
−
+
, where d is the reconfiguration
cost, and is found in [1]. Experiments on the performance of various algorithms are presented in
[4] and [5].
The problem can be solved in polynomial time if we consider a zero setup cost or if we only want
to minimize the number of switchings [9]. Another variation of the problem for which the optimal
schedule can be calculated in polynomial time is presented in [1].
For the purposes of this paper we consider 2 algorithms published in the past:
• A-PBS(d+1), found in [1], which so far is the one with the lowest approximation ratio,
and
• A1, found in [5], which according to past experiments yields the best experimental
results.
To compute each packet to be transmitted, A-PBS(d+1) rounds up the time of each message to the
closest multiple of d+1 and calculates the packet reducing the workload of each station to the
minimum multiple of d+1.
On the other hand A1 computes an arbitrary packet with a maximum number of messages and
decides how to preempt by calculating a lower bound to the remaining transmissions cost to be
the minimum possible.
3. GRAPH REPRESENTATION AND NOTATIONS
Our data representation will be through a bipartite graph G(V,U,E). V will be the set of
transmitters, U the set of receivers while E, the set of edges, will correspond to the messages that
have to be transmitted from V to U. A weight (or cost) c(v,u), will be assigned to each of the
edges e=(v,u), to denote the time required to transmit the message from node v to node u. Edge
weights are considered to be non-negative integers.
Furthermore the following notation will be used: ∆=∆(G)=max{
v V
max(deg(v))
∈
,
u U
max(deg(u))
∈
},
that is, ∆ will denote the maximum number of messages that need to be either sent or received
from or to any of the stations.
3. Computer Science & Information Technology (CS & IT) 193
The function t: V∪U→Z*
+ will denote the total workload of any station, namely t(v)=
u U
c(v,u)
∈
∑
for any v∈V or t(u)=
v V
c(v,u)
∈
∑ for any u∈U.
W=W(G)=max{
v V
max(t(v))
∈
,
u U
max(t(u))
∈
}, that is W will denote the maximum transmission time of
the messages either sent to or received from any station.
d∈Z*
+ will denote the overhead to start the next transmission.
4. A HEURISTIC WITH IMPROVED RESULTS
For the purposes of our algorithm the initial graph is split in two parts. GM comprises edges of
weight at least d and Gm contains all edges of weight less than d. Our main concern for GM is to
keep reducing the workload for each of the stations, achieving the minimum transmission time
possible, whereas in the case of Gm, where edge weights are small in comparison to d, we aim in
minimizing the number of switchings. The intuition in designing this algorithm is that for
messages of long duration, priority on how to schedule has the message duration rather than the
number of preemptions, whilst for messages of shortest duration prioritized is the minimization of
the number of preemptions. In particular:
The Split-Graph Algorithm (SGA)
Step 1: Split the initial graph G(V,U,E) in two bipartite graphs Gm(Vm,Um,Em) and
GM(VM,UM,EM), where Vm=VM=V, Um=UM=U and Em contains all edges of weight less than d,
EM contains all edges of weight d or more. Clearly in this initiation step E=Em∪EM and
Em∩EM=∅.
Step 2: Use subroutine1 to find a maximal matching M, in GM.
Step 3: Use subroutine 2 to calculate the weight of the matching to be removed. Remove the
corresponding parts of the edges.
Step 4: Add edges to M, from Em to maximize |M| and remove them from Em.
Step 5: Move edges of weight less than d, from the graph induced by step 3 to Em.
Step 6: Repeat steps 2 to 5 until all edges initially in EM have been completely removed.
Step 7: Use subroutine 3 to calculate ∆m maximum matchings in Gm, where ∆m is the degree of
Gm.
Step 8: Schedule the messages as calculated in steps 2, 3 and 7.
Subroutine 1:
Step 1: M=∅ (Initialization of the matching).
Step 2: For each node w∈VM∪UM calculate t(w).
Step 3: Sort all nodes w∈VM∪UM in decreasing order of t(w). Let L be the induced list of nodes.
Step 4: Let w0 be the 1st node to appear in L. Run sequential search in L to find the 1st neighbor
of w0 appearing in L. Denote that neighbor by w1.
Step 5: M←M∪{w0, w1}.
Step 6: Remove w0, w1 from L.
Step 7: Repeat steps 2, to 6 until M becomes maximal.
4. 194 Computer Science & Information Technology (CS & IT)
Subroutine 2:
Step 1: For each edge e=(v,u) of the matching M, with corresponding weight c(e) calculate what
the value W(G΄) of the induced graph G΄(V΄,U΄,E΄) would be if all edge weights in the matching
were to be reduced by c(e). In this case edges of cost less than c(e) would be completely removed.
Set
c(e) ,if W(G ) W(G) c(e)
r(e)
0, otherwise
′ = −
=
Step 2: Calculate R=max{r(e) | e∈M}
Step 3: For each edge in M set its new weight c(e)=
c(e) R, if c(e) R
0, otherwise
− >
.
Subroutine 3:
Step 1: Add nodes and edges to make Gm a regular graph of degree ∆m. New edges will be of zero
weight. In a regular graph, all nodes will be of the same degree.
Step 2: Calculate a maximum matching Mm in Gm and remove all edges of Mm from Gm. Gm’s
degree will now be reduced by 1.
Step 3: Repeat step 2 until Gm=∅.
5. EXPERIMENTAL RESULTS AND COMPARISON
Figure 1 represents each algorithms’ performance in terms of approximation ratio. 1000 test cases
have been ran for a 15 transmitters-15 receivers system for values of setup cost varying from 1 to
200 and message durations varying from 1 to 50. SGA performs significantly better than both A1
and A-PBS(d+1) and as the overhead increases it shows an increasingly improved performance. It
is important to mention that in practice, as information loads exponentially increase, the number
of stations and communication tasks increases and so does the setup cost. That is in fact the most
encountered situation nowadays.
Figure 1. Average approximation ratio comparison
5. Computer Science & Information Technology (CS & IT) 195
Figure 2 presents the worst performance that each algorithm had depending on the setup cost, in
terms of approximation ratio again. SGA is found to be once again a lot more efficient.
Furthermore, SGA in most cases has a worst case really close to the average showing that its
performance does not fluctuate much, making it an all cases a reliable tool for this type of
scheduling.
Figure 2. Worst approximation ratio comparison
In terms of running time, SGA also appears to be a lot more efficient, as experiments have shown
that A1 and A-PBS(d+1) are by up to 500% slower. This is mainly because SGA is based on an
entire different approach on how to schedule the messages, using subroutines that in general are a
lot faster than those used in previous papers.
6. DISCUSSION AND FUTURE WORK
Our newly presented algorithm (SGA), has proven to produce much more efficient routings both
in terms of hardware usage as well as time span. Therefore, we believe that the idea of splitting
the initial graph in parts can be further researched and depending on the magnitude of the edges
as well as the setup cost, the Split-Graph Algorithm’s efficiency can be further improved. An
approximation ratio for SGA could be established to be less than 2. Exploiting to a greater extend
algorithms that provide optimal solutions for special instances of the problem might also yield
interesting new approximation algorithms. Finally, lifting limitations of the problem or
introducing new ones could help in developing new classes of graphs for which polynomial
algorithms might provide an optimal schedule. Such algorithms could be the tools to designing
new and improved approximation algorithms.
REFERENCES
[1] F. Afrati, T. Aslanidis, E. Bampis, I. Milis, Scheduling in Switching Networks with Set-up Delays.
Journal of Combinatorial Optimization, vol. 9, issue 1, p.49-57, Feb 2005.
[2] G. Bongiovanni, D. Coppersmith and C. K.Wong, An optimal time slot assignment for an SS/TDMA
system with variable number of transponders, IEEE Trans. Commun. vol. 29, p. 721-726, 1981.
6. 196 Computer Science & Information Technology (CS & IT)
[3] J. Cohen, E. Jeannot, N. Padoy and F. Wagner, Messages Scheduling for Parallel Data Redistribution
between Clusters, IEEE Transactions on Parallel and Distributed Systems, vol. 17, Number 10, p.
1163, 2006.
[4] J. Cohen, E. Jeannot, N. Padoy, Parallel Data Redistribution Over a Backbone, Technical Report RR-
4725, INRIA-Lorraine, February 2003.
[5] P. Crescenzi, X. Deng, C. H. Papadimitriou, On approximating a scheduling problem, Journal of
Combinatorial Optimization, vol. 5, p. 287-297, 2001.
[6] R. L. Cruz and S. Al-Harthi, Packet Scheduling with Switch Configuration Delays, in Proc. 39th
Annu. Allerton Conf. Commun., Contr., Comput., 2001.
[7] S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems
SIAM J. Comput., vol. 5, p. 691-703, 1976.
[8] I. S. Gopal, G. Bongiovanni, M. A. Bonucelli, D. T. Tang, C. K. Wong, An optimal switching
algorithm for multibeam satellite systems with variable bandwidth beams, IEEE Trans. Commun. vol.
30, p. 2475-2481, Nov. 1982.
[9] I. S. Gopal, C. K. Wong Minimizing the number of switchings in an SS/TDMA system IEEE Trans.
Commun. vol. 33, p. 497-501, 1985.
[10] T. Inukai, An efficient SS/TDMA time slot assignment algorithm IEEE Trans. Commun. vol 27, p.
1449-1455, Oct. 1979.
[11] E. Jeannot and F. Wagner, Two fast and efficient message scheduling algorithms for data
redistribution over a backbone, 18th International Parallel and Distributed Processing Symposium,
2004.
[12] A. Kesselman and K. Kogan, Nonpreemptive Scheduling of Optical Switches, IEEE Transactions in
Communications, vol. 55, number 6, p. 1212, 2007.
[13] K. S. Natarajan and S. B. Calo, Time slot assignment in an SS/TDMA system with minimum
switchings IBM Res. Rep. 1981.
[14] B. Towles and W. J. Dally, Guaranteed Scheduling of Switches with Configuration Overhead, in
Proc. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
INFOCOM ’02. pp. 342-351, June 2002.
Authors
Timotheos Aslanidis was born in Athens, Greece in 1974. He received his Mathematics
degree from the University of Athens in 1997 and a master's degree in computer science
in 2001. He is currently a phd candidate at the National and Technical University of
Athens in the department of electrical and computer engineering. His research interests
comprise but are not limited to computer theory, number theory, network algorithms and
data mining algorithms.
Marios-Evangelos Kogias was born in Athens in 1991. Currently, he is an undergraduate
student at the National Technical University of Athens pursuing a diploma in Electrical
and Computer Engineering. He is a passionate coder and interested mainly in operating
systems, computer networks and algorithms.